import std.stdio, std.array, std.string, std.conv, std.algorithm;
import std.typecons, std.range, std.random, std.math, std.container;
import std.numeric, std.bigint, core.bitop, std.bitmanip, std.regex;

immutable int N = 60;
immutable int K = 500;

void main() {
    readln.split;
    auto L = readln.split.map!(to!int).array;
    auto A = N.iota.map!(_ => readln.chomp.map!(a => a == '1').array).array;
    int[][] ops;

    foreach (l; L) {
        int best_score = -100;
        int[] best_op = [-1, -1, -1, -1];

        foreach (i; 0..N) {
            foreach (j; 0..N-l+1) {
                int score = 0;
                foreach (k; j..j+l) {
                    score += A[i][k] ? 1 : -1;
                }
                if (score > best_score) {
                    best_score = score;
                    best_op = [i, j, i, j+l-1];
                }
            }
        }

        foreach (j; 0..N) {
            foreach (i; 0..N-l+1) {
                int score = 0;
                foreach (k; i..i+l) {
                    score += A[k][j] ? 1 : -1;
                }
                if (score > best_score) {
                    best_score = score;
                    best_op = [i, j, i+l-1, j];
                }
            }
        }

        foreach (i; best_op[0]..best_op[2]+1)
            foreach (j; best_op[1]..best_op[3]+1)
                A[i][j] ^= 1;

        ops ~= best_op;
    }

    foreach (op; ops)
        op.map!(a => (a+1).to!string).join(" ").writeln;
}