#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <iterator>
#include <bitset>
#include <complex>
#include <fstream>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T> T RoundOff(T a){ return int(a+.5-(a<0)); }
template<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }
template<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }
template<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }

int n;

bool reachble(vector<vint> str, int s, int e)
{
    rep(i, str.size())
    {
        if(s < n-1 && str[i][s]) s++;
        else if(0 < s && str[i][s-1]) s--;
    }
    
    return s == e;
}

int main()
{
    while(cin >> n && n)
    {
        int m, g, d;
        cin >> m >> g >> d;
        m--; g--;
        
        vector<vint> stair(d, n-1);
        
        rep(i, d)
        {
            string bln;
            cin >> bln;
            
            rep(j, n)
                stair[i][j] = bln[j] - '0';
        }
        
        
        if(reachble(stair, m, g)) cout << 0 << endl;
        else
        {
            rep(i, d) rep(j, n-1)
            {
                if(!stair[i][j])
                {
                    stair[i][j] = 1;
                    if(reachble(stair, m, g))
                    {
                        cout << i + 1 << " " << j + 1 << endl;
                        goto ng;
                    }
                    stair[i][j] = 0;
                }
            }
            cout << 1 << endl;
        ng:;            
        }
    }    
}