#include <bits/stdc++.h>
#define SIZE 300005
#define MOD 1000000007LL
#define INF 1 << 30
#define LLINF 1LL << 60
#define REP(i,n) for(int i=0;i<n;i++)
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define DOWN(i,b,a) for(int i=b;i>=a;i--)
#define SET(a,c) memset(a,c,sizeof a)
#define FORALL(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define FOREACH(i,c) for(auto (i) : (c))
#define BIT(i,j) ((i)>>(j))&1
#define ALL(o) (o).begin(), (o).end()
#define ERASE(o) (o).erase(unique((o).begin(),(o).end()), (o).end())
#define SQ(x) ((x)*(x))
using namespace std;
typedef long long ll;
typedef valarray<int> Array;
typedef pair<ll,ll> Pll;
typedef pair<int, int> Pii;
typedef pair<double, double> Pdd;
template<typename T> inline void priv(vector<T>a){REP(i,a.size()){cout<<a[i]<<((i==a.size()-1)?"\n":" ");}}
ll gcd(ll a,ll b){int c=max(a,b);int d=min(a,b);return c==0||d==0?c:gcd(c%d,d);}
ll lcm(ll a,ll b){return a==0||b==0?0:a*b/gcd(a,b);}

int n,f,t,d;
vector<string> S;

bool judge()
{
  vector<int> p(n);
  FOR(i,1,n) p[i-1]=i;
  REP(i,d) REP(j,n-1) if(S[i][j]=='1') swap(p[j],p[j+1]);
  return p[t-1]==f;
}

void solve()
{
  if(judge())
  {
    cout << 0 << endl;
    return;
  }
  vector<vector<bool> > q(d,vector<bool>(n-1,false));
  REP(i,d) REP(j,n-1)
  {
    if(j==0) q[i][j] = (S[i][j]=='0'&&S[i][j+1]=='0');
    else if(j==n-2) q[i][j] = (S[i][j-1]=='0'&&S[i][j]=='0');
    else q[i][j] = (S[i][j-1]=='0'&&S[i][j]=='0'&&S[i][j+1]=='0');
  }
  REP(i,d)REP(j,n-1)if(q[i][j])
  {
    S[i][j] = '1';
    if(judge())
    {
      cout << i+1 << " " << j+1 << endl;
      return;
    }
    S[i][j] = '0';
  }
  cout << 1 << endl;
}

int main()
{
  while(cin>>n,n)
  {
    cin >> f >> t >> d;
    S.resize(d);
    REP(i,d) cin >> S[i];
    solve();
  }
  return 0;
}