#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define LINF (ll)INF*INF
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,a,n) for(int i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;
typedef vector<pii> vp;

int gcd(int a, int b){
    if(b==0) return a;
    return gcd(b,a%b);
}
int lcm(int a, int b){
    return a/gcd(a,b)*b;
}

int n,d;
vs s;

bool f(int ind, int g){
    rep(i,d){
        if(ind < n-1 && s[i][ind] == '1')ind++;
        else if(ind && s[i][ind-1] == '1')ind--;
    }
    return ind == g;
}

signed main(void) {
    while(cin >> n, n){
        int m;
        int k;//あたり
        cin >> m >> k >> d;
        m--;k--;
        s = vs(d);
        rep(i,d)cin >> s[i];
        if(f(m,k)){
            cout << 0 << endl;
        }else{
            bool ans = false;
            rep(i,d)rep(j,n-1){
                if(ans)continue;
                bool ng = s[i][j] == '1';
                if(j && s[i][j-1] == '1')ng = true;
                if(j < n-2 && s[i][j+1] == '1')ng = true;
                if(ng)continue;
                s[i][j]++;
                if(f(m,k)){
                    cout << i+1 << " " << j+1 << endl;
                    ans = true;
                    break;
                }
                s[i][j]--;
            }
            if(ans == false)cout << 1 << endl;
        }
    }
}

