def main():
    a = A
    for l in L:
        case1 = challenge(l, a)
        _, row1, col1, row2, col2 = case1
        invert = a[row1-1][col1-1:col2]
        a[row1-1][col1-1:col2] = list(map(lambda x: int(not x), invert))
        print(row1, col1, row2, col2)

def challenge(l, grid):
    maxb = -1
    ret = []
    for i, r in enumerate(grid):
        for j in range(N + 1 - l):
            black = r[j:j+l].count(1)
            if maxb < black:
                maxb = black
                row = i + 1
                ret = [maxb, row, j + 1, row, j + l]
    return ret

N, K = map(int, input().split())
L = tuple(map(int, input().split()))
A = [list(map(int, list(input()))) for _ in [0] * N]
main()