#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; }

// ---- ----

int n, k, l[500], a[60][60];

void f() {
	return;
	
	inc(i, n) {
	inc(j, n) {
		cout << a[i][j] << " ";
	} cout << endl;
	} cout << endl;
}

int main() {
	cin >> n >> k;
	inc(i, k) { cin >> l[i]; }
	inc(i, n) {
		string s;
		cin >> s;
		inc(j, s.size()) { a[i][j] = (s[j] == '0' ? 0 : 1); }
	}
	
	f();
	
	inc(q, k) {
		auto ma = MP(MP(-1, 0), MP(-1, -1));
		inc(i, n) {
		inc(j, n + 1 - l[q]) {
			int s = 0;
			inc(m, l[q]) { s += a[i][j + m]; }
			setmax(ma, MP(MP(s, 0), MP(i, j)));
		}
		}
		inc(j, n) {
		inc(i, n + 1 - l[q]) {
			int s = 0;
			inc(m, l[q]) { s += a[i + m][j]; }
			setmax(ma, MP(MP(s, 1), MP(i, j)));
		}
		}
		
		if(ma.FI.SE == 0) {
			inc(m, l[q]) { a[ma.SE.FI][ma.SE.SE + m] ^= 1; }
			cout << ma.SE.FI + 1 << " " << ma.SE.SE + 1 << " " << ma.SE.FI + 1 << " " << ma.SE.SE + l[q] << endl;
		} else {
			inc(m, l[q]) { a[ma.SE.FI + m][ma.SE.SE] ^= 1; }
			cout << ma.SE.FI + 1 << " " << ma.SE.SE + 1 << " " << ma.SE.FI + l[q] << " " << ma.SE.SE + 1 << endl;
		}
		
		f();
	}
	
	return 0;
}