#include <string>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int seed = 123456789;
int rand_gen() {
	seed ^= seed << 13;
	seed ^= seed >> 17;
	seed ^= seed << 5;
	return seed;
}
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<vector<int> > x = v;
	vector<int> vx(K), vy(K);
	int score = 0;
	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[i]; k++) {
				int sum = 0;
				for (int l = k; l < k + L[i]; l++) sum += x[j][l];
				if (sum > cur) {
					cur = sum, px = j, py = k;
				}
			}
		}
		vx[i] = px;
		vy[i] = py;
		for (int j = py; j < py + L[i]; j++) x[px][j] ^= 1;
		score += cur * 2 - L[i];
	}
	while (true) {
		int iniscore = score;
		for (int i = 0; i < K; i++) {
			int choose = 0, cur = 0;
			for (int j = -N + 1; j <= N - 1; j++) {
				if (j == 0) continue;
				int ty = vy[i] + j;
				if (0 <= ty && ty <= N - L[i]) {
					int delta = 0;
					for (int k = ty + L[i]; k < vy[i] + L[i]; k++) delta += (x[vx[i]][k] == 1 ? 1 : -1);
					for (int k = ty; k < vy[i]; k++) delta += (x[vx[i]][k] == 1 ? 1 : -1);
					if (delta > cur) {
						cur = delta;
						choose = j;
					}
				}
			}
			if (choose != 0) {
				int ty = vy[i] + choose;
				for (int k = ty + L[i]; k < vy[i] + L[i]; k++) score += (x[vx[i]][k] == 1 ? 1 : -1), x[vx[i]][k] ^= 1;
				for (int k = ty; k < vy[i]; k++) score += (x[vx[i]][k] == 1 ? 1 : -1), x[vx[i]][k] ^= 1;
				vy[i] = ty;
			}
		}
		if (score == iniscore) break;
	}
	for (int i = 0; i < N; i++) cout << vx[i] + 1 << ' ' << vy[i] + 1 << ' ' << vx[i] + 1 << ' ' << vy[i] + L[i] << endl;
	return 0;
}