T = int(input())
for _ in range(T):
    H,W = list(map(int,input().split()))
    A = [list(map(int,input().split())) for _ in range(H)]

    flag = False
    for i in range(H):
        now = sorted(A[i])
        if(now[-1] + now[-2] > 0):
            flag = True

    for j in range(W):
        now = sorted([A[i][j] for i in range(H)])
        if(now[-1] + now[-2] > 0):
            flag = True

    for _ in range(2):
        for i in range(H+W-1):
            now = sorted([A[j][i-j] for j in range(max(0, i-W+1), min(i, H-1)+1)])
            if(len(now) >= 2 and now[-1] + now[-2] > 0):
                flag = True
        A = [i[::-1] for i in A]


    print("infinite" if flag else "finite")