#include <bits/stdc++.h>
using namespace std;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define vv(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i))
#define mat(type, c, m, n) vector<vector<type>> c(m, vector<type>(n));for(auto& r:c)for(auto& i:r)cin>>i;
#define rep(i,a,n) for(int i=(a), i##_len=(n); i<i##_len; ++i)
#define rrep(i,a,n) for(int i=(a), i##_len=(n); i>i##_len; --i)
#define each(x,y) for(auto &(x):(y))
#define var(type, ...)type __VA_ARGS__;Scan(__VA_ARGS__);
template<typename T> void Scan(T& t) { cin >> t; }
template<typename First, typename...Rest>void Scan(First& first, Rest&...rest) { cin >> first; Scan(rest...); }
#define vec(type, c, n) vector<type> c(n);for(auto& i:c) cin>>i;
#define len(x) ((int)(x).size())
#define mp make_pair
#define eb emplace_back
#define em emplace
#define pb pop_back
#define fi first
#define se second
#define get(a, i) get<i>(a)
#define bit_count __builtin_popcount
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> pii;
#define mini min_element
#define maxi max_element
#define sum(a, b) accumulate(a, b)
#define chmax(a,b) if(a<b)a=b
#define chmin(a,b) if(a>b)a=b
template <class T> inline void print(T t){cout << t << "\n";}
template <class H, class... T> inline void print(H h, T... t){cout << h << " ";print(t...);}
int str_bin(string s) {
	int t = 0;
	rep(i, 0, len(s)) {
		t = t * 2 + (s[i] == '1');
	}
	return t;
}
void solve() {
	var(int, n, k);
	int t = 0, rt = 0, len_t = 0;
	vi l(k);
	rep(i, 0, k) {
		cin >> l[i];
		t ^= (1 << l[i]) - 1;
	}
	for (int tt = t; tt > 0; tt >>= 1) {
		rt = rt * 2 + (tt & 1);
		++len_t;
	}
	vec(string, s, n);
	rep(i, 0, n) {
		rep(j, 0, n - len_t + 1) {
			int a = str_bin(s[i].substr(j, len_t));
			int bit_cnt_a = bit_count(a);
			if (bit_count(a ^ t) < bit_cnt_a) {
				rep(m, 0, k) {
					print(i + 1, j + 1, i + 1, j + l[m]);
				}
				return;
			}
			if (bit_count(a ^ rt) < bit_cnt_a) {
				rep(m, 0, k) {
					print(i + 1, j + len_t - l[m], i + 1, j + len_t);
				}
				return;
			}
		}
	}
	rep(i, 0, n - len_t + 1) {
		rep(j, 0, n) {
			string ss = "";
			rep(m, i, i + len_t)
				ss += s[m][j];
			int a = str_bin(ss);
			int bit_cnt_a = bit_count(a);
			if (bit_count(a ^ t) < bit_cnt_a) {
				rep(m, 0, k) {
					print(i + 1, j + 1, i + l[m], j + 1);
				}
				return;
			}
			if (bit_count(a ^ rt) < bit_cnt_a) {
				rep(m, 0, k) {
					print(i + 1 + len_t - l[m], j + 1, i + len_t, j + 1);
				}
				return;
			}
		}
	}
}
int main() {
	solve();
	return 0;
}