#include <string>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
	int N, K;
	cin >> N >> K;
	vector<int> L(K);
	for (int i = 0; i < K; i++) cin >> L[i];
	vector<vector<int> > v(N, vector<int>(N));
	for (int i = 0; i < N; i++) {
		string s;
		cin >> s;
		for (int j = 0; j < N; j++) {
			v[i][j] = s[j] - '0';
		}
	}
	vector<int> p(K);
	for (int i = 0; i < K; i++) p[i] = i;
	sort(p.begin(), p.end(), [&](int i, int j) { return L[i] > L[j]; });
	vector<int> va(K), vb(K), vc(K), vd(K);
	for (int i = 0; i < K; i++) {
		int px = -1, py = -1, cur = -1;
		for (int j = 0; j < N; j++) {
			for (int k = 0; k <= N - L[p[i]]; k++) {
				int sum = 0;
				for (int l = k; l < k + L[p[i]]; l++) sum += v[j][l];
				if (sum > cur) {
					cur = sum, px = j, py = k;
				}
			}
		}
		va[p[i]] = px + 1;
		vb[p[i]] = py + 1;
		vc[p[i]] = px + 1;
		vd[p[i]] = py + L[p[i]];
		for (int j = py; j < py + L[p[i]]; j++) {
			v[px][j] ^= 1;
		}
	}
	for (int i = 0; i < N; i++) cout << va[i] << ' ' << vb[i] << ' ' << vc[i] << ' ' << vd[i] << endl;
	return 0;
}