# coding: utf-8 # import time import random from heapq import heappush,heappop def evalute(grid): return sum([r.count(0) for r in grid]) def operation_grid(op, grid): rev_grid = grid if op[1] == op[3]: length = op[2] - op[0] + 1 for i in range(length): rev_grid[op[0]-1+i][op[1]-1] = (grid[op[0]-1+i][op[1]-1]+1)&1 if op[0] == op[2]: length = op[3] - op[1] + 1 for i in range(length): rev_grid[op[0]-1][op[1]-1+i] = (grid[op[0]-1][op[1]-1+i]+1)&1 return rev_grid def count_black_horizon(grid, base_x, base_y, length): return grid[base_y][base_x:base_x + length].count(1) def count_black_vertical(grid, base_x, base_y, length): return [grid[i][base_x] for i in range(base_y,base_y + length)].count(1) # begin = time.time() N,K = map(int,input().split()) L = list(map(int,input().split())) A = [list(map(int,list(input()))) for i in range(N)] operation = [] P = 3 for k in range(K): hq = [] for x in range(N-L[k]): for i in range(P): y = random.randint(0, N-L[k]) horizon_cnt = count_black_horizon(A, x, y, L[k]) vertical_cnt = count_black_vertical(A, x, y, L[k]) if horizon_cnt < vertical_cnt: heappush(hq, (-vertical_cnt, [y+1, x+1, y+L[k], x+1])) else: heappush(hq, (-horizon_cnt, [y+1, x+1, y+1, x+L[k]])) for y in range(N-L[k]): for i in range(P): x = random.randint(0, N-L[k]) horizon_cnt = count_black_horizon(A, x, y, L[k]) vertical_cnt = count_black_vertical(A, x, y, L[k]) if horizon_cnt < vertical_cnt: heappush(hq, (-vertical_cnt, [y+1, x+1, y+L[k], x+1])) else: heappush(hq, (-horizon_cnt, [y+1, x+1, y+1, x+L[k]])) cnt, op = heappop(hq) A = operation_grid(op, A) operation.append(op) best_score = evalute(A) print('\n'.join([' '.join(list(map(str,op))) for op in operation])) # print('best_score = ' + str(best_score)) # print('----END----') # take = time.time() - begin # print(str(round(int(take * 1000),3)) + " ms")