#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <bitset>
#include <cstring>
#define CLR(a,v) memset(a,v,sizeof(a))
#define FOR(i,x,n) for(__typeof(x) i = (x); i != (n); i++)
#define FRI(it,v) FOR(it,v.begin(),v.end())
#define FR(i,n) FOR(i,0,n)
#define ALL(x) (x).begin(),(x).end()
#define SZ size()
#define PB push_back
#define MP make_pair
#define show(x) cerr<<#x<<"="<<x<<endl

using namespace std;

typedef pair<int, int> Pr;
typedef long long LL;
const LL INF = 1LL <<50;

using namespace std;


int n, m;
const int MAXN = 100 + 3;
typedef pair<int,int> PII;
PII a[MAXN][MAXN];

void rotateTable(PII a[][MAXN]) {
  PII b[MAXN][MAXN];
  swap(m,n);
  FR(i,n) FR(j,m) b[i][j] = a[j][n-1-i];
  FR(i,n) FR(j,m) a[i][j] = b[i][j];
}

void writeTable() {
  FR(i,n) {
    FR(j,m) cout << a[i][j].first << " ";
    cout << endl;
  }
}

int main() {
  int testn;  cin >> testn;
  FR(testi,testn) {
    cin >> n >> m;
    FR(i,n) FR(j,m) 
      {cin >> a[i][j].first; a[i][j].second = 0;}

    FR(rotTimes, 4) {
      FR(i,n) {
	int msf = a[i][0].first;
	FR(j,m) if (a[i][j].first >= msf) 
	  { msf = a[i][j].first; a[i][j].second = true; }
      }
      rotateTable(a);
    }
    //writeTable();

    int ans = 0;
    FR(i,n) FR(j,m) ans += (a[i][j].second == 0);
    cout << ans << endl;
  }
  return 0;
}