#include <string>
#include <vector>
#include <iostream>
using namespace std;
const int max_l = 25;
int main() {
	cin.tie(0);
	ios_base::sync_with_stdio(false);
	int N, K;
	cin >> N >> K;
	vector<int> l(K), x(K), y(K), rem(max_l + 1);
	vector<vector<int> > g(max_l + 1);
	for (int i = 0; i < K; ++i) {
		cin >> l[i];
		rem[l[i]]++;
		g[l[i]].push_back(i);
	}
	vector<string> v(N);
	for (int i = 0; i < N; ++i) cin >> v[i];
	for (int i = max_l; i >= 1; --i) {
		while (rem[i] > 0) {
			int cur = -1, mx = -1, my = -1;
			for (int j = 0; j < N; ++j) {
				int sum = 0;
				for (int k = 0; k < i; k++) sum += (v[j][k] == '1' ? 1 : 0);
				for (int k = 0; k <= N - i; ++k) {
					if ((k == 0 || v[j][k] != v[j][k - 1]) && (k + i == N || v[j][k + i] != v[j][k + i - 1]) && cur < sum) {
						cur = sum, mx = j, my = k;
					}
					if (k != N - i) {
						sum += (v[j][k + i] == '1' ? 1 : 0);
						sum -= (v[j][k] == '1' ? 1 : 0);
					}
				}
			}
			--rem[i];
			x[g[i][rem[i]]] = mx;
			y[g[i][rem[i]]] = my;
			for (int j = my; j < my + i; ++j) v[mx][j] = (v[mx][j] == '0' ? '1' : '0');
		}
	}
	for (int i = 0; i < K; ++i) {
		cout << x[i] + 1 << ' ' << y[i] + 1 << ' ' << x[i] + 1 << ' ' << y[i] + l[i] << '\n';
	}
	return 0;
}