#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)   FOR(i,0,n)
#define pb emplace_back
typedef long long ll;
typedef pair<int,int> pint;

int n,k;
int L[501],g[61][61];
string s[61];
pair<pint,pint> calc(int length){
    int best=-1000100010;
    int lx,rx,ly,ry;
    rep(i,n)rep(j,n-length+1){
        int score=0;
        rep(k,length){
            if(g[i][j+k]==1) ++score;
            else --score;
        }
        if(best<score) lx=j,rx=j+length-1,ly=i,ry=i,best=score;
    }
    rep(i,n)rep(j,n-length+1){
        int score=0;
        rep(k,length){
            if(g[j+k][i]==1) ++score;
            else --score;
        }
        if(best<score) ly=j,ry=j+length-1,lx=i,rx=i,best=score;
    }
    FOR(i,ly,ry+1)FOR(j,lx,rx+1) g[i][j]^=1;
    return make_pair(pint(ly+1,lx+1),pint(ry+1,rx+1));
}
int main(){
    cin>>n>>k;
    rep(i,k) cin>>L[i];
    rep(i,n) cin>>s[i];
    rep(i,n)rep(j,n) g[i][j]=s[i][j]-'0';
    rep(i,k){
        pair<pint,pint> ret=calc(L[i]);
        cout<<ret.first.first<<" "<<ret.first.second<<" "<<ret.second.first<<" "<<ret.second.second<<endl;
    }
    return 0;
}