#include<bits/stdc++.h>
#define ll long long    
#define ull unsigned long long
#define db double
#define ldb long double
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define FR first
#define SE second
using namespace std;
inline int read() {
  int x = 0; bool op = 0;
  char c = getchar();
  while(!isdigit(c))op |= (c == '-'), c = getchar();
  while(isdigit(c))x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
  return op ? -x : x;
}
const int N = 410;
const int P = 998244353;
void add(int &a, int b) {a += b; a >= P ? a -= P : 0;}
void sub(int &a, int b) {a -= b; a < 0 ? a += P : 0;}
int ksm(int x, int k) {
  int res = 1;
  for(int pw = x; k; (k & 1) ? res = 1ll * res * pw % P : 0, pw = 1ll * pw * pw % P, k >>= 1);
  return res;
}
int n, m;
int a[N][N], f[N], sz[N];
int find(int x) {return f[x] == x ? x : f[x] = find(f[x]);}
bool work() {
  for(int i = 1; i <= n; i++)if(a[i][i])return false;
  for(int i = 1; i <= n; i++)
    for(int j = i + 1; j <= n; j++)
      if(a[i][j] != a[j][i])return false;
  for(int i = 1; i <= n; i++)f[i] = i, sz[i] = 1;
  for(int i = 1; i <= n; i++)
    for(int j = 1; j <= n; j++)
      if(a[i][j] == 0) {
        int x = find(i), y = find(j);
        if(x != y)f[x] = y, sz[y] += sz[x];
      }
  for(int i = 1; i <= n; i++)
    for(int j = 1; j <= n; j++) {
      int x = find(i), y = find(j);
      if(a[i][j] != a[x][y])return false;
    }
  return true;
}
int val1[N], val2[N * N], val3[N * N], fac[N], ifac[N];
void init() {
  fac[0] = ifac[0] = 1;
  for(int i = 1; i < N; i++)fac[i] = 1ll * fac[i - 1] * i % P;
  ifac[N - 1] = ksm(fac[N - 1], P - 2);
  for(int i = N - 2; i; i--)ifac[i] = 1ll * ifac[i + 1] * (i + 1) % P;
  return ;
}
int com(int n, int m) {return n < m || m < 0 ? 0 : 1ll * fac[n] * ifac[m] % P * ifac[n - m] % P;}
int calc(int m) {
  for(int i = 1; i <= n; i++)
    for(int j = 1; j <= n; j++)
      if(a[i][j] > m)return 0;
  val2[0] = val3[0] = 1;
  for(int i = 1; i <= n * n; i++) {
    val2[i] = 1ll * val2[i - 1] * m % P;
    val3[i] = 1ll * val3[i - 1] * (m + 1) % P;
  }
  for(int i = 1; i <= n; i++) {
    val1[i] = val3[i * (i - 1) / 2];
    for(int j = 1; j < i; j++) {
      int c1 = val1[j];
      int c2 = val2[j * (i - j)];
      int c3 = val3[(i - j) * (i - j - 1) / 2];
      int res = 1ll * c1 * c2 % P * c3 % P;
      sub(val1[i], 1ll * com(i - 1, j - 1) * res % P);
    }
  }
  int ans = 1;
  for(int i = 1; i <= n; i++)
    if(find(i) == i)ans = 1ll * ans * val1[sz[i]] % P;
  for(int i = 1; i <= n; i++) {
    for(int j = i + 1; j <= n; j++) {
      if(find(i) != i || find(j) != j)continue;
      int mn = m;
      for(int k = 1; k <= n; k++)
        if(a[i][k] && a[k][j])mn = min(mn, a[i][k] + a[k][j]);
      if(mn < a[i][j])return 0;
      int res = ksm(m - a[i][j] + 1, sz[i] * sz[j]);
      if(mn > a[i][j])sub(res, ksm(m - a[i][j], sz[i] * sz[j]));
      ans = 1ll * ans * res % P;
    }
  }
  return ans;
}
void solve() {
  n = read(); m = read();
  for(int i = 1; i <= n; i++)
    for(int j = 1; j <= n; j++)
      a[i][j] = read();
  if(!work())return puts("0"), void();
  int ans = (calc(m) - calc(m - 1) + P) % P;
  printf("%d\n", ans);
  return ;
}
int main() { 
  init();
  int test = read();
  while(test--)solve();
  return 0;
}