def solve():
    H, W = [int(s) for s in input().split()]
    grid = [[int(s) for s in input().split()] for _ in range(H)]

    for i in range(H):
        for j in range(W):
            for di in [-1, 0, 1]:
                for dj in [-1, 0, 1]:
                    for d in range(1, max(H, W) + 1):
                        ni, nj = i + d * di, j + d * dj

                        if not (0 <= ni < H and 0 <= nj < W):
                            break

                        if grid[i][j] + grid[ni][nj] >= 1:
                            print("infinite")
                            return

    print("finite")


if __name__ == "__main__":
    T = int(input())

    for _ in range(T):
        solve()