#include <list>
#include <set>
#include <map>
#include <ctime>
#include <stack>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <queue>
#include <deque>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <iterator>
#include <cassert>
#include <fstream>
#include <numeric>
#include <iomanip>
#include <complex>
#include <sstream>
#include <iostream>
#include <algorithm>
using namespace std;
 
#define For(i,n) for( int i=0; i < n; i++)
#define FOR(i,a,b) for( __typeof(b) i=(a); i<=(b); i++)
#define ALL(c)  c.begin() , c.end()
#define LL long long
#define int64 LL
#define Set(t,v) memset((t), (v), sizeof(t))

typedef vector < int > VI;
typedef pair< int , int > PII;
#define fr first
#define se second
#define pi M_PI
#define rad(x) (x)*acos(-1)/180.0
#define EPS 1e-6
#define INF 10000*10000
stringstream ss;

/**************************Code****************************/

int a[110][110];

int main()
{
	int t, n, m;
	cin >> t;
	while( t -- )
	{
		cin >> n >> m;
		For( i , n )
			For( j , m )
				cin >> a[i][j];
		int cnt = 0;
		For( i , n )
			For( j , m )
			{
				int flag = 0;
				for( int k = 0 ; k < i ; k ++ )
					if( a[i][j] < a[k][j] )
						flag = 1;
				if( !flag )
					continue;
				flag = 0;
				for( int k = i+1 ; k < n ; k ++ )
					if( a[i][j] < a[k][j] )
						flag = 1;
				if( !flag )
					continue;
				flag = 0;
				for( int k = 0 ; k < j ; k ++ )
					if( a[i][j] < a[i][k] )
						flag = 1;
				if( !flag )
					continue;
				flag = 0;
				for( int k = j+1 ; k < m ; k ++ )
					if( a[i][j] < a[i][k] )
						flag = 1;
				if( !flag )
					continue;
				flag = 0;
				cnt ++;
			}
		cout << cnt << endl;
	}
	return 0;
}