def main():
    grid = [[0] * (N + 2)]
    apnd = grid.append
    for n in A:
        apnd([0] + n + [0])
    apnd([0] * (N + 2))

    for l in L:
        case1 = search1(l, grid)
        if l == 1:
            case2 = case1
        else:
            grid = list(map(list, zip(*grid)))
            case2 = search1(l, grid)

        if case1[1] >= case2[1]:
            if l > 1:
                grid = list(map(list, zip(*grid)))
            _, _, row1, col1, row2, col2 = case1
            line = grid[row1][col1:col2]
            grid[row1][col1:col2] = list(map(lambda x: int(not x), line))
            print(row1, col1, row2, col2 - 1)
        else:
            _, _, row1, col1, row2, col2 = case2
            line = grid[row1][col1:col2]
            grid[row1][col1:col2] = list(map(lambda x: int(not x), line))
            row1, col1 = col1, row1
            row2, col2 = col2, row2
            grid = list(map(list, zip(*grid)))
            print(row1, col1, row2 - 1, col2)

def search1(l, grid):
    max1, maxsub = 0, 0
    ret = []
    for i in range(1, N + 1):
        cnt = 0
        for j in range(1, N + 1):
            if grid[i][j]:
                cnt += 1
            if j >= l:
                col1 = (j - l) + 1
                cnt -= grid[i][j-l]
                if max1 <= cnt:
                    max1 = cnt
                    maxsub = kadane(grid[i][col1:col1+l])
                    ret.append((maxsub, max1, i, col1, i, col1 + l))
                if cnt == l and not grid[i][col1-1] and not grid[i][col1+l]:
                    ret.sort(reverse=1)
                    return ret[0]
    ret.sort(reverse=1)
    return ret[0]

def kadane(a):
    max_current = max_global = a[0]
    for i in range(1, len(a)):
        max_current = max(a[i], max_current + a[i])
        if max_current > max_global:
            max_global = max_current
    return max_global

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