#include <bits/stdc++.h>

using namespace std;

using pii = pair<int, int>;
using ll = long long;
const int N = 2000010, MOD = 998244353, INF = 0x3f3f3f3f;
int n, m, w[N];


int a[101][101];
void solve() {
	scanf("%d%d", &n, &m);
	for (int i = 1; i < n + 1; i++)
		for (int j = 1; j < m + 1; j++)
			scanf("%d", a[i] + j);
	for (int i = 1; i < n + 1; i++)
		for (int j = 1; j < m + 1; j++)
			for (int k = 1; k < n + 1; k++)
				for (int l = 1; l < m + 1; l++) {
					if (i == k && j == l) continue;
				if (i == k || j == l || i - k == abs(j - l))
						if (a[i][j] + a[k][l] > 0) {
							puts("infinite");
							return;
						}
					}
	puts("finite");
}

int main() {
	int T = 1;
	scanf("%d", &T);
	while (T--) solve();
	return 0;
}