def solve():
    H, W = map(int, input().split())
    A = [list(map(int, input().split())) for _ in range(H)]
    
    for i in range(H):
        a = A[i][:]
        a.sort(reverse=True)
        if sum(a[:2]) > 0:
            print("infinite")
            return
    
    for j in range(W):
        a = [A[i][j] for i in range(H)]
        a.sort(reverse=True)
        if sum(a[:2]) > 0:
            print("infinite")
            return
    
    a1 = [[] for _ in range(H + W)]
    a2 = [[] for _ in range(H + W)]
    
    for i in range(H):
        for j in range(W):
            a1[i + j].append(A[i][j])
            a2[i - j + W - 1].append(A[i][j])
    
    if any(sum(sorted(a)[:2]) > 0 for a in a1 + a2):
        print("infinite")
    else:
        print("finite")


for _ in range(int(input())):
    solve()