#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int T,H,W;
int A[101][101];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>T;
	while(T--) {
		cin>>H>>W;
		int ok=0;
		FOR(y,H) FOR(x,W) cin>>A[y][x];
		FOR(y,H) {
			int ma=-1<<30;
			FOR(x,W) {
				if(ma+A[y][x]>0) ok=1;
				ma=max(ma,A[y][x]);
			}
		}
		FOR(x,W) {
			int ma=-1<<30;
			FOR(y,H) {
				if(ma+A[y][x]>0) ok=1;
				ma=max(ma,A[y][x]);
			}
		}
		map<int,int> m1,m2;
		FOR(y,H) FOR(x,W) {
			i=y+x;
			j=y-x;
			if(m1.count(i)&&m1[i]+A[y][x]>0) ok=1;
			if(m2.count(j)&&m2[j]+A[y][x]>0) ok=1;
			if(m1.count(i)==0) m1[i]=A[y][x];
			else m1[i]=max(m1[i],A[y][x]);
			if(m2.count(j)==0) m2[j]=A[y][x];
			else m2[j]=max(m2[j],A[y][x]);
			
			
		}
		
		if(ok) {
			cout<<"infinite"<<endl;
		}
		else {
			cout<<"finite"<<endl;
		}
	}
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}