#include<algorithm>
#include<cassert>
#include<iostream>
#include<vector>
#include<random>
using namespace std;
typedef long long lint;
typedef vector<int>vi;
typedef pair<int,int>pii;
#define rep(i,n)for(int i=0;i<(int)(n);++i)

const int DEBUG=0;

const int K=500;
int l[K];
const int N=60;
string a[N];
int b[N][N];

int calc_score(const vector<pii>&ans){
  int c[N][N];
  rep(i,N)rep(j,N)c[i][j]=b[i][j];
  rep(i,ans.size()){
    if(ans[i].second<0){
      assert(ans[i].first+l[i]-1<=N);
      rep(j,l[i])
	c[ans[i].first+j-1][-ans[i].second-1]^=1;
    }
    else{
      assert(ans[i].second+l[i]-1<=N);
      rep(j,l[i])
	c[ans[i].first-1][ans[i].second+j-1]^=1;
    }
  }
  int t=0;
  rep(i,N)rep(j,N)t+=1-c[i][j];
  return t;
}

void output(const vector<pii>&ans){
  int orig=calc_score(vector<pii>());
  rep(i,ans.size()){
    if(ans[i].second<0)
      cout<<ans[i].first<<" "<<-ans[i].second<<" "<<(ans[i].first+l[i]-1)<<" "<<-ans[i].second<<endl;
    else
      cout<<ans[i].first<<" "<<ans[i].second<<" "<<ans[i].first<<" "<<(ans[i].second+l[i]-1)<<endl;
  }
  int sc=calc_score(ans);
  cerr<<"orig="<<orig<<endl;
  cerr<<"scor="<<sc<<endl;
  cerr<<"diff="<<sc-orig<<endl;
}

int main(){
  int n,k;
  cin>>n>>k;
  assert(n==N);
  assert(k==K);
  rep(i,k)cin>>l[i];
  rep(i,n)cin>>a[i];
  rep(i,n)rep(j,n)b[i][j]=a[i][j]=='1';
  int ma=-1e8;
  vector<pii> ans(k);
  // +:horizontal, -:vertical
  rep(i,k)ans[i]=pii(1,1);
  ma=calc_score(ans);
  int seed=('k'<<16)^('i'<<15)^('r'<<14)^('i'<<13)^('k'<<12)^('a'<<11);
  mt19937 mt(seed);
  vector<pii> cur(ans);
  int sc=ma;
  bool fire=true;
  vector<vi> len(26);
  rep(i,k)len[l[i]].push_back(i);
  for(int u=25;u>=1;--u){
    if(len[u].size()==0)continue;
    rep(iter,(2<=u&&u<=6?50:20)){
      if(DEBUG){
	if(iter%200==0){
	  cerr<<"len="<<u<<" "<<iter<<":"<<sc<<endl;
	  fire=true;
	}
      }
      vector<pii> nxt(cur);
      int idx=len[u][mt()%len[u].size()];
      pair<int,pii> tt(-1,pii(-1,-1));
      rep(j,N){
	nxt[idx].first=mt()%(N-l[idx]+1)+1;
	nxt[idx].second=-(j+1);
	tt=max(tt,make_pair(calc_score(nxt),nxt[idx]));
      }
      rep(i,N){
	nxt[idx].first=i+1;
	nxt[idx].second=mt()%(N-l[idx]+1)+1;
	tt=max(tt,make_pair(calc_score(nxt),nxt[idx]));
      }
      nxt[idx]=tt.second;
      int nxtsc=calc_score(nxt);
      if(nxtsc>=sc){
	cur=nxt;
	sc=nxtsc;
      }
      if(sc>ma){
	if(DEBUG){
	  if(fire){
	    cerr<<"updmax "<<ma<<"->"<<sc<<endl;
	    fire=false;
	  }
	}
	ma=sc;
	ans=cur;
      }
    }
  }
  //output
  output(ans);
}