#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
using namespace std;

typedef long long ll;
typedef vector<int> vint;
typedef vector<long long> vll;
typedef pair<int,int> pint;
typedef pair<long long, long long> pll;

#define MP make_pair
#define PB push_back
#define ALL(s) (s).begin(),(s).end()
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P) 
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P) 
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P) 
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s << endl; }



int n, m, s, d;
string str;
vint order[100];
vint ok[100];


void solve() {
	for (int i = 0; i < 100; ++i) order[i].clear(), ok[i].clear();
	vint now(n);
	for (int i = 1; i <= n; ++i) now[i-1] = i;
	order[0] = now;
	for (int i = 1; i <= d; ++i) {
		cin >> str;
		for (int j = 0; j < str.size(); ++j) {
			if (str[j] == '1') swap(now[j], now[j+1]);
			else {
				if (j == 0) {
					if (str[j+1] != '1') ok[i].PB(j);
				}
				else if (j == n-1) {
					if (str[j-1] != '1') ok[i].PB(j);
				}
				else {
					if (str[j-1] != '1' && str[j+1] != '1') ok[i].PB(j);
				}
			}
		}
		order[i] = now;
	}

	if (order[d][s-1] == m) {
		puts("0");
		return;
	}


	for (int i = 1; i <= d; ++i) {
		for (int j = 0; j < ok[i].size(); ++j) {
			int nj = ok[i][j];
			int a = order[i][nj], b = order[i][nj+1];
			if (a == m && order[d][s-1] == b) {
				cout << i << " " << nj+1 << endl;
				return;
			}
			if (b == m && order[d][s-1] == a) {
				cout << i << " " << nj+1 << endl;
				return;
			}
		}
	}
	puts("1");
	return;
}

int main() {
	while (cin >> n) {
		if (n == 0) break;
		cin >> m >> s >> d;
		solve();
	}
    return 0;
}
