#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i,n,m) for(ll i=(n);i<(m);i++)
#define REP(i,n) FOR(i,0,n)
#define REPR(i,n) for(ll i=(n);i>=0;i--)
#define all(vec) vec.begin(),vec.end()
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using P=pair<int,int>;
using PP=pair<ll,P>;
using vp=vector<P>;
using vpp=vector<PP>;
using vs=vector<string>;
#define fi first
#define se second
#define pb push_back
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}
const ll MOD=1000000007LL;
const int INF=1<<30;
const ll LINF=1LL<<60;
int dx[]={-1,0,1,0},dy[]={0,-1,0,1};
const int ScoreA=15;
const int ScoreB=1;
const int ScoreC=2;
int main(){
    int n,k;
    cin>>n>>k;
    vi d(k);
    REP(i,k){
        cin>>d[i];
    }
    vs vec(n);
    REP(i,n){
        cin>>vec[i];
    }
    REP(i,k){
        int ma=-INF;
        P p(0,0);
        bool f=false;
        REP(j,n){
            REP(k,n-d[i]){
                int q=0;
                REP(l,d[i]){
                    if(vec[j][k+l]=='1'){
                        q+=ScoreA;
                    }else{
                        q-=ScoreA;
                    }
                    REP(dir,4){
                        if(0<=j+dx[dir]&&j+dx[dir]<n&&0<=k+l+dy[dir]&&k+l+dy[dir]<n){
                            if(vec[j][k+l]!=vec[j+dx[dir]][k+l+dy[dir]]){
                                if(dy[dir]){
                                    q-=ScoreB;
                                }else{
                                    q+=ScoreC;
                                }
                            }
                        }
                    }
                }
                if(q>ma){
                    ma=q;
                    p=P(j,k);
                    f=false;
                }
            }
        }
        REP(j,n-d[i]){
            REP(k,n){
                int q=0;
                REP(l,d[i]){
                    if(vec[j+l][k]=='1'){
                        q+=ScoreA;
                    }else{
                        q-=ScoreA;
                    }
                    REP(dir,4){
                        if(0<=j+l+dx[dir]&&j+l+dx[dir]<n&&0<=k+dy[dir]&&k+dy[dir]<n){
                            if(vec[j+l][k]!=vec[j+l+dx[dir]][k+dy[dir]]){
                                if(dx[dir]){
                                    q-=ScoreB;
                                }else{
                                    q+=ScoreC;
                                }
                            }
                        }
                    }
                }
                if(q>ma){
                    ma=q;
                    p=P(j,k);
                    f=true;
                }
            }
        }
        if(!f){
            REP(l,d[i]){
                if(vec[p.fi][p.se+l]=='1'){
                    vec[p.fi][p.se+l]='0';
                }else{
                    vec[p.fi][p.se+l]='1';
                }
            }
            cout<<p.fi+1<<" "<<p.se+1<<" "<<p.fi+1<<" "<<p.se+d[i]<<endl;            
        }else{
            REP(l,d[i]){
                if(vec[p.fi+l][p.se]=='1'){
                    vec[p.fi+l][p.se]='0';
                }else{
                    vec[p.fi+l][p.se]='1';
                }
            }
            cout<<p.fi+1<<" "<<p.se+1<<" "<<p.fi+d[i]<<" "<<p.se+1<<endl;                        
        }
    }
    return 0;
}