#include<cstdio>#include<cstring>#include<algorithm>#include<set>#include<iostream>#include<bits/stdc++.h>usingnamespace std;typedeflonglong ll;#define space putchar(' ')#define enter putchar('\n')typedef pair<int,int> PII;constint mod=1e4+7;constint N=2e6+10;constint inf=0x7f7f7f7f;
ll gcd(ll a,ll b){return b==0?a:gcd(b,a%b);}
ll lcm(ll a,ll b){return a*(b/gcd(a,b));}template<classT>voidread(T &x){char c;bool op =0;while(c =getchar(), c <'0'|| c >'9')if(c =='-')
op =1;
x = c -'0';while(c =getchar(), c >='0'&& c <='9')
x = x *10+ c -'0';if(op)
x =-x;}template<classT>voidwrite(T x){if(x <0)
x =-x,putchar('-');if(x >=10)write(x /10);putchar('0'+ x %10);}int a[50][50];int vis[150][150];intmain(){int t;
cin>>t;while(t--){memset(vis,0,sizeof vis);int n,m;
cin>>n>>m;for(int i=1;i<=n;i++){for(int j=1;j<=m;j++){
cin>>a[i][j];int step,v;
step=i+j-2;
v=a[i][j];
vis[step][v]++;}}int ans=0;for(int i=0,j=n+m-2;j>i;j--,i++){
ans+=min(vis[i][1]+vis[j][1],vis[i][0]+vis[j][0]);}
cout<<ans<<endl;}return0;}