
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <memory>
#include <string>

#include <algorithm>
#include <complex>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>

using namespace std;

#ifdef _MSC_VER
#define __typeof__ decltype
#endif

#define ITER(c)             __typeof__((c).begin())
#define FOREACH(it, c)      for (ITER(c) it=(c).begin(); it != (c).end(); ++it)
#define RITER(c)            __typeof__((c).rbegin())
#define RFOREACH(it, c)     for (RITER(c) it=(c).rbegin(); it != (c).rend(); ++it)
#define REP(i, n)           REPEAT(i, 0, n)
#define RREP(i, n)          RREPEAT(i, 0, n);
#define REPEAT(i, k, n)     for(int i = (k); i < (k+n); ++i)
#define RREPEAT(i, k, n)    for(int i = (k)+(n)-1; i >= (k); ++i)
#define ALL(c)              (c).begin(), (c).end()
#define LLPOW(p1,p2)        ((ll)pow((double)(p1), (int)p2))
#define ESIZEOF(A)          (sizeof(A)/sizeof((A)[0]))
#define MIN(p1,p2)          (((p1)<(p2))?(p1):(p2))
#define MAX(p1,p2)          (((p1)>(p2))?(p1):(p2))
#define CIN_NO_SYNC         do { cin.tie(0); ios_base::sync_with_stdio(false); } while(0)
#define GETSTR(p)           fgets((p), sizeof(p), stdin)
#define CHOMP(p)            do{ char *_q = (p) + strlen(p)-1; if(*_q == '\n' || *_q == '\r') *_q = 0; } while(0)
#define mp                  make_pair

typedef long long ll;
typedef unsigned long long ull;

#define X real()
#define Y imag()
typedef double D;
typedef complex<D> P;
#define EPS (1e-9)

#ifdef _DEBUG
#define pf printf
#define pr(n) do { cout << #n " = " << (n) << endl; } while(0)
#else
#define pf(...) /* */
#define pr(...) /* */
#endif

int check(int n, int s, vector<string> &v){
    FOREACH(it, v){
        if(s-2 >= 0 && (*it)[s-2] == '1'){
            s--; continue;
        }
        if(s-1 < n-1 && (*it)[s-1] == '1'){
            s++; continue;
        }
    }
    return s;
}

void solve(int n, int s, int g, int d, vector<string> &v){
    if(g == check(n, s, v)){
        cout << 0 << endl;
        return;
    }
    REP(i,d){
        REP(j,n-1){
            bool flag = true;
            REPEAT(k,-1,3){
                int l = j+k;
                if(l < 0 || l >= n-1) continue;
                if(v[i][l] == '1') flag = false;
            }
            if(!flag) continue;

            v[i][j] = '1';
            if(g == check(n, s, v)){
                cout << i+1 << " " << j+1 << endl;
                return;
            }
            v[i][j] = '0';
        }
    }
    cout << 1 << endl;
}

int main(){
    while(1){
        int n, m, g, d;
        cin >> n;
        if(n == 0) break;
        cin >> m >> g >> d;
        string s;
        vector<string> v;
        REP(i,d){
            cin >> s;
            v.push_back(s);
        }
        solve(n,m,g,d,v);
    }
    return 0;
}