#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define Z class
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
template<Z A>void pr(A a){cout<<a;ln;}
template<Z A,Z B>void pr(A a,B b){cout<<a<<' ';pr(b);}
template<Z A,Z B,Z C>void pr(A a,B b,C c){cout<<a<<' ';pr(b,c);}
template<Z A,Z B,Z C,Z D>void pr(A a,B b,C c,D d){cout<<a<<' ';pr(b,c,d);}
template<Z A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1e9+7,MAXL=1LL<<61,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> PP;
typedef pair<PP,PP> P2;
typedef pair<int,vector<vector<int> > > P;
priority_queue<P,vector<P>,greater<P> > que[555];
map<vector<vector<int> >,int> ma[555];
map<vector<vector<int> >,vector<vector<int> > > q1[555];
map<vector<vector<int> >,P2> q2[555];

void Main() {
  int n,m;
  cin >> n >> m;
  PP d[m];
  rep(i,m) {
    cin >> d[i].F;
    d[i].S=i;
  }
  //sort(d,d+m,greater<PP>());
  string s[n];
  rep(i,n) cin >> s[i];
  vector<vector<int> > a(n,vector<int>(n));
  rep(i,n)rep(j,n)a[i][j]=s[i][j]=='1';
  rep(i,n)rep(j,n) {
    if(!a[i][j]) ma[0][a]++;
  }
  que[0].push(P(ma[0][a],a));
  rep(k,m) {
    while(!que[k].empty()) {
      P q=que[k].top();que[k].pop();
      int c=q.F;
      a=q.S;
      vector<vector<int> > b;
      rep(i,n) {
        int cc=c;
        b=a;
        rep(j,n) {
          if(j+d[k].F>n) break;
          if(b[i][j]) {
            rep(l,d[k].F) {
              b[i][j+l]^=1;
              if(!b[i][j+l]) cc++;
              else cc--;
            }
            if(!ma[k+1].count(b)) {
              ma[k+1][b]=cc;
              q1[k+1][b]=a;
              q2[k+1][b]=P2(PP(i+1,j+1),PP(i+1,j+d[k].F));
              que[k+1].push(P(cc,b));
            }
            break;
          }
        }
        cc=c;
        b=a;
        rep(j,n) {
          if(j+d[k].F>n) break;
          if(b[j][i]) {
            rep(l,d[k].F) {
              b[j+l][i]^=1;
              if(!b[j+l][i]) cc++;
              else cc--;
            }
            if(!ma[k+1].count(b)) {
              ma[k+1][b]=cc;
              q1[k+1][b]=a;
              q2[k+1][b]=P2(PP(j+1,i+1),PP(j+d[k].F,i+1));
              que[k+1].push(P(cc,b));
            }
            break;
          }
        }
        cc=c;
        b=a;
        rep(j,n) {
          if(j+d[k].F>n) break;
          if(b[i][n-1-j]) {
            rep(l,d[k].F) {
              b[i][n-1-j-l]^=1;
              if(!b[i][n-1-j-l]) cc++;
              else cc--;
            }
            if(!ma[k+1].count(b)) {
              ma[k+1][b]=cc;
              q1[k+1][b]=a;
              q2[k+1][b]=P2(PP(i+1,n-j-d[k].F+1),PP(i+1,n-j));
              que[k+1].push(P(cc,b));
            }
            break;
          }
        }
        cc=c;
        b=a;
        rep(j,n) {
          if(j+d[k].F>n) break;
          if(b[n-1-j][i]) {
            rep(l,d[k].F) {
              b[n-1-j-l][i]^=1;
              if(!b[n-1-j-l][i]) cc++;
              else cc--;
            }
            if(!ma[k+1].count(b)) {
              ma[k+1][b]=cc;
              q1[k+1][b]=a;
              q2[k+1][b]=P2(PP(n-j-d[k].F+1,i+1),PP(n-j,i+1));
              que[k+1].push(P(cc,b));
            }
            break;
          }
        }
        while(que[k+1].size()>=100000) {
          P q=que[k+1].top();que[k+1].pop();
          ma[k+1].erase(q.S);
        }
      }
    }
    ma[k].clear();
  }
  vector<vector<int> > v;
  int M=-MAX;
  tr(it,ma[m]) {
    if(it->S>M) {
      M=it->S;
      v=it->F;
    }
  }
  P2 ans[m];
  rrep(i,m) {
    ans[d[i].S]=q2[i+1][v];
    v=q1[i+1][v];
  }
  rep(i,m) pr(ans[i].F.F,ans[i].F.S,ans[i].S.F,ans[i].S.S);
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}