import java.util.Arrays; import java.util.Comparator; import java.util.Scanner; public class Main { int N; int[][] curMap; int[][] A; void run() { Scanner sc = new Scanner(System.in); N = sc.nextInt(); int K = sc.nextInt(); int[] L = new int[K]; int[][] L_sort = new int[K][2]; curMap = new int[N][N]; for (int i = 0; i < K; ++i) { L[i] = sc.nextInt(); L_sort[i][0] = L[i]; L_sort[i][1] = i; } Arrays.sort(L_sort, new Comparator() { @Override public int compare(int[] o1, int[] o2) { return Integer.compare(o1[0], o2[0]); } }); A = new int[N][N]; for (int i = 0; i < N; ++i) { char[] cs = sc.next().toCharArray(); for (int j = 0; j < N; ++j) { A[i][j] = (int) (cs[j] - '0'); } curMap[i] = Arrays.copyOf(A[i], A[i].length); } long[] list = new long[K]; { int[][] dp = new int[N][N]; for (int i = N - 1; i >= 0; --i) { for (int j = 0; j < N; ++j) { if (curMap[i][j] > 0) dp[i][j] += (i + 1 < N ? dp[i + 1][j] : 0) + curMap[i][j]; } } boolean[] used = new boolean[K]; out: for (int i = 0; i < K; ++i) { for (int j = K - 1; j > i; --j) { if (used[L_sort[j][1]] || used[L_sort[i][1]]) continue; int Len = L_sort[j][0] - L_sort[i][0]; for (long x = 0; x + L_sort[j][0] <= N; ++x) { for (long y = 0; y < N; ++y) { if (dp[(int) x][(int) y] < Len) continue; long opi = (y + 1) << 32 | (x + 1 + Len); long opj = (y + 1) << 32 | (x + 1); int cnt = 0; cnt += act(curMap, opi, L_sort[i][0]); cnt += act(curMap, opj, L_sort[j][0]); list[L_sort[i][1]] = opi; list[L_sort[j][1]] = opj; used[L_sort[i][1]] = true; used[L_sort[j][1]] = true; { for (int s = 0; s < N; ++s) dp[s][(int) y] = 0; for (int s = N - 1; s >= 0; --s) { if (curMap[s][(int) y] > 0) dp[s][(int) y] += (s + 1 < N ? dp[s + 1][(int) y] : 0) + curMap[s][(int) y]; } } continue out; } } } } for (int i = 0; i < K; ++i) { if (used[i]) continue; long op = rnd(L[i]); list[i] = op; act(curMap, list[i], L[i]); } } for (int t = 0; t < 500000; ++t) { int i = (int) (Math.random() * K); int j = (int) (Math.random() * K); if (i == j) continue; long opi = rnd(L[i]); long opj = rnd(L[j]); if (act(curMap, list[i], L[i]) + act(curMap, list[j], L[j]) + act(curMap, opi, L[i]) + act(curMap, opj, L[j]) > 0) { list[i] = opi; list[j] = opj; } else { act(curMap, list[i], L[i]); act(curMap, list[j], L[j]); act(curMap, opi, L[i]); act(curMap, opj, L[j]); } } for (int i = 0; i < K; ++i) { out(list[i], L[i]); } System.out.println(getPt()); } int act(int[][] map, long op, int L) { int ret = 0; int sign = (int) (op / Math.abs(op)); op = Math.abs(op); int px = (int) op; int py = (int) (op >> 32); if (sign == 1) { for (int i = px; i <= px + L - 1; ++i) { for (int j = py; j <= py; ++j) { if (curMap[i - 1][j - 1] == 1) ++ret; else --ret; curMap[i - 1][j - 1] ^= 1; } } } else { for (int i = px; i <= px; ++i) { for (int j = py; j <= py + L - 1; ++j) { if (curMap[i - 1][j - 1] == 1) ++ret; else --ret; curMap[i - 1][j - 1] ^= 1; } } } return ret; } long rnd(int L) { while (true) { long px = (long) (Math.random() * N) + 1; long py = (long) (Math.random() * N) + 1; if (px + L <= N + 1) { return (px | (py << 32)); } else if (py + L <= N + 1) { return (-(px | py << 32)); } else { continue; } } } int getPt() { int ret = 0; for (int i = 0; i < N; ++i) { for (int j = 0; j < N; ++j) { if (A[i][j] == 0) --ret; } } for (int i = 0; i < N; ++i) { for (int j = 0; j < N; ++j) { if (curMap[i][j] == 0) ++ret; } } return ret; } void out(long a, int L) { int sign = (int) (a / Math.abs(a)); a = Math.abs(a); int px = (int) a; int py = (int) (a >> 32); if (sign == 1) { System.out.println(px + " " + py + " " + (px + L - 1) + " " + py); } else { System.out.println(px + " " + py + " " + px + " " + (py + L - 1)); } } public static void main(String[] args) { new Main().run(); } void tr(Object... objects) { System.out.println(Arrays.deepToString(objects)); } }