#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

template <class T, class U>
vector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); }

template<class... Ts, class U>
auto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); }

template<class T> void chmin(T &a, const T &b){ a = (a < b ? a : b); }
template<class T> void chmax(T &a, const T &b){ a = (a > b ? a : b); }


template <class T>
ostream& operator<<(ostream& os, vector<T> v) {
    os << "{";
    for (int i = 0; i < v.size(); ++i) {
        if(i) os << ", ";
        os << v[i];
    }
    return os << "}";
}

template <class L, class R>
ostream& operator<<(ostream& os, pair<L, R> p) {
    return os << "{" << p.first << ", " << p.second << "}";
}


void solve(int w){
    int s, g, h;
    cin >> s >> g >> h;
    auto v = make_v(h, vector<int>(w, 0));
    s--; g--;
    for (int i = 0; i < h; ++i) {
        string S;
        cin >> S;
        for (int j = 0; j < w-1; ++j) {
            v[i][j] = S[j] == '1';
        }
    }
    auto ok = [&](){
        vector<int> ok(w);
        ok[s] = 1;
        for (int i = 0; i < h; ++i) {
            for (int j = 0; j < w-1; ++j) {
                if(v[i][j]) swap(ok[j], ok[j+1]);
            }
        }
        return ok[g];
    };
    if(ok()) {
        puts("0");
        return;
    }
    for (int i = 0; i < h; ++i) {
        for (int j = 0; j < w-1; ++j) {
            if(!v[i][j] && (!j || !v[i][j-1]) && (j == w-1 || !v[i][j+1])){
                v[i][j] = 1;
                if(ok()){
                    printf("%d %d\n", i+1, j+1);
                    return;
                }
                v[i][j] = 0;
            }
        }
    }
    puts("1");
}

int main() {
    int n;
    while(cin >> n, n){
        solve(n);
    }
    return 0;
}
