#include <bits/stdc++.h>
using namespace std;

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

template<typename T> void  Asort(T * a, int n) { sort(a, a + n,    less<T>()); }
template<typename T> void RAsort(T * a, int n) { sort(a, a + n, greater<T>()); }

int n, k, a[60][60];
pair<int, int> l[500];
array<int, 4> ans[500];

int main() {
	cin >> n >> k;
	inc(i, k) {
		int x; cin >> x;
		l[i] = MP(x, i);
	}
	inc(i, n) {
		string s;
		cin >> s;
		inc(j, s.size()) { if(s[j] == '1') { a[i][j] ^= 1; } }
	}
	
	// RAsort(l, k);
	
	inc(q, k) {
		array<int, 4> ma = { -1, 0, 0, 0 };
		inc(i, n) {
		inc(j, n + 1 - l[q].FI) {
			int s = 0;
			inc(m, l[q].FI) { s += a[i][j + m]; }
			setmax(ma, { s, i, j, 0 });
		}
		}
		inc(j, n) {
		inc(i, n + 1 - l[q].FI) {
			int s = 0;
			inc(m, l[q].FI) { s += a[i + m][j]; }
			setmax(ma, { s, i, j, 1 });
		}
		}
		
		if(ma[3] == 0) {
			inc(m, l[q].FI) { a[ma[1]][ma[2] + m] ^= 1; }
			ans[l[q].SE] = { ma[1], ma[2], ma[1], ma[2] + l[q].FI - 1 };
		} else {
			inc(m, l[q].FI) { a[ma[1] + m][ma[2]] ^= 1; }
			ans[l[q].SE] = { ma[1], ma[2], ma[1] + l[q].FI - 1, ma[2] };
		}
	}
	
	inc(i, k) {
		inc(j, 4) { cout << ans[i][j] + 1 << (j == 3 ? "\n" : " "); }
	}
	
	return 0;
}