#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=1e6+5,M=(1<<28)+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(28382);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,m,c[N],B[N],sum[N];
vector<int> A[N];
map<int,int> f[N];
int pre[N],suf[N];
int dp[N],g[N];
void Solve(){
	scanf("%d%d",&m,&n);
	for(int i=1;i<=m;i++) scanf("%d",&c[i]);
	for(int i=1;i<=n;i++){
		A[i].resize(m+1);
		for(int j=1;j<=m;j++) scanf("%d",&A[i][j]);
	}
	for(int i=1;i<=n;i++) if(find(A[i].begin()+1,A[i].end(),0)==A[i].end()){puts("-1");return;}
	for(int i=1;i<=m;i++) if(c[i]&&A[1][i]){puts("-1");return;}
	fill(B+1,B+m+1,0);
	for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) B[j]+=A[i][j];
	for(int i=1;i<=m;i++) f[i].clear(),f[i][i]=B[i];
	auto chkmin=[](int x,int y,int w){
		auto it=f[x].insert(make_pair(y,w));
		if(it.se) it.fi->se=min(it.fi->se,w);
		else f[x][y]=min(f[x][y],w);
	};
	for(int i=n;i;i--){
		pre[0]=0;for(int j=1;j<=m;j++) pre[j]=(A[i][j]?pre[j-1]:j);
		suf[m+1]=m+1;for(int j=m;j;j--) suf[j]=(A[i][j]?suf[j+1]:j);
		partial_sum(B+1,B+m+1,sum+1);
		for(int j=1;j<=m;j++)while(!f[j].empty()){
			auto [a,b]=*f[j].begin();
			// gdb(i,a,pre[j],suf[j]);
			if(a>=suf[j]) break;
			gdb(i,a,b);
			f[j].erase(f[j].begin());
			if(suf[j]<=m) chkmin(j,suf[j],b+sum[suf[j]]-sum[a]);
			if(pre[j]) chkmin(pre[j],a,b+sum[j-1]-sum[pre[j]-1]);
		}
		if(i^1) for(int j=1;j<=m;j++) B[j]-=A[i][j];
	}
	fill(dp,dp+m+1,INF);fill(g,g+m+1,INF);dp[0]=0;
	int mi=0;
	for(int i=1;i<=m;i++){
		for(auto [a,b]:f[i]) g[a]=min(g[a],mi+sum[i-1]+b-sum[a]),gdb(i,a,b);
		if(!c[i]) dp[i]=dp[i-1];
		g[i]=min(g[i-1],g[i]);dp[i]=min(dp[i],g[i]+sum[i]);
		mi=min(mi,dp[i]-sum[i]);
	}
	printf("%d\n",dp[m]);
}
int main(){
	int t=1;
	scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}