#include <bits/stdc++.h>
#define ull unsigned ll
#define ll long long
#define ld long double
#define INFL (ll)3e18
#define INF (int)2e9
#define MOD (ll)998244353
#define MODO (ll)(1e9+7)
using namespace std;

template<typename T>istream&operator>>(istream&is,vector<T>&v);
template<typename... Ts>istream&operator>>(istream&is,tuple<Ts...>& t);
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
template<typename... Ts>istream& operator>>(istream& is, tuple<Ts...>& t) {apply([&](auto&... args) {((is >> args), ...);},t);return is;}

int main(void){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int t;
    cin >> t;
    while(t--){
        int h,w;
        cin >> h >> w;
        vector<vector<ll>> a(h,vector<ll>(w));
        cin >> a;
        ll ma = 0;
        for(int i = 0;i < h;i++){
            for(int j = 0;j < w;j++){
                for(int k = 0;k < j;k++){
                    ma = max(ma,a[i][j]+a[i][k]);
                }
            }
        }
        for(int i = 0;i < h;i++){
            for(int j = 0;j < w;j++){
                for(int k = 0;k < i;k++){
                    ma = max(ma,a[i][j]+a[k][j]);
                }
            }
        }
        for(int i = 0;i < h;i++){
            for(int j = 0;j < w;j++){
                for(int k = 0;i+k<h&&j+k<w;k++){
                    ma = max(ma,a[i][j]+a[i+k][j+k]);
                }
            }
        }
        for(int i = 0;i < h;i++){
            for(int j = 0;j < w;j++){
                for(int k = 0;i+k<h&&j-k>=0;k++){
                    ma = max(ma,a[i][j]+a[i+k][j-k]);
                }
            }
        }
        
        if(ma > 0) cout << "infinite" << endl;
        else cout << "finite" << endl;
    }
}