#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
// using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
// using mint = modint998244353;
// const int mod = 998244353;
// const int INF = 1e9;
// const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A& a, const B& b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A& a, const B& b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int t; cin >> t;
	while (t--) {
		int n, m; cin >> n >> m;
		vector a(n, vector<int>(m));
		rep(i, n)rep(j, m)cin >> a[i][j];
		bool chk = false;
		rep(i, n) {
			vector<int>x;
			rep(j, m)x.push_back(a[i][j]);
			sort(allR(x));
			if (x.size() == 1)continue;
			if (x[0] + x[1] > 0)chk = true;
		}
		rep(j, m) {
			vector<int>x;
			rep(i, n)x.push_back(a[i][j]);
			sort(allR(x));
			if (x.size() == 1)continue;
			if (x[0] + x[1] > 0)chk = true;
		}
		{
			map<int, vector<int>>mp0, mp1;
			rep(i, n)rep(j, m) {
				mp0[i + j].push_back(a[i][j]);
				mp1[i - j].push_back(a[i][j]);
			}
			rep(_, 2) {
				for (auto [k, v] : mp0) {
					sort(allR(v));
					if (v.size() == 1)continue;
					if (v[0] + v[1] > 0)chk = true;
				}
				mp0.swap(mp1);
			}
		}
		if (chk)cout << "infinite" << endl;
		else cout << "finite" << endl;
	}
	return 0;
}