cig/pirates_treasure.py

def neighbors(x, y):
    return [(x + 1, y), (x + 1, y + 1),(x, y + 1),(x - 1, y + 1),(x + 1, y - 1),(x - 1, y - 1),(x - 1, y ),(x, y - 1)]

input()
my = {(x, y): int(v) for y in range(int(input())) for x, v in enumerate(input().split())}

for c in my:
    if my[c] == 0:
        for j in neighbors(*c):
            if my.get(j,1) == 0:
                break
        else:
            print(f"{x} {y}")