行列二分图模型，行指向列即表示权重w[i][j]
避免零流的方法就是使下界为1

#include<bits/stdc++.h>
#define rep(i,j,k) for(int i = j; i <= k; i++)
#define repp(i,j,k) for(int i = j; i < k; i++)
#define rrep(i,j,k) for(int i = j; i >= k; i--)
#define repe(i,u) for(int i = head[u]; ~i; i = nxt[i])
#define scan(a) scanf("%d",&a)
#define scann(a,b) scanf("%d%d",&a,&b)
#define scannn(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define println(a) printf("%d\n",a)
#define printbk(a) printf("%d ",a)
#define print(a) printf("%d",a)
using namespace std;
const int maxn = 1e5+11;
const int oo = 0x3f3f3f3f;
int to[maxn<<1],nxt[maxn<<1],cap[maxn<<1],flow[maxn<<1];
int head[maxn],tot;
void init(){memset(head,-1,sizeof head);tot=0;
}
void add(int u,int v,int w){to[tot]=v;nxt[tot]=head[u];cap[tot]=w;flow[tot]=0;head[u]=tot++;swap(u,v);to[tot]=v;nxt[tot]=head[u];cap[tot]=0;flow[tot]=0;head[u]=tot++;
}
int n,m,s,t;
int dis[maxn],pre[maxn],cur[maxn],gap[maxn];
bool vis[maxn];
struct QUEUE{int que[maxn];int front,rear;void init(){front=rear=0;}void push(int u){que[rear++]=u;}int pop(){return que[front++];}bool empty(){return front==rear;}
}que;
void bfs(){memset(vis,0,sizeof vis);que.init();que.push(t);vis[t]=1;dis[t]=0;while(que.empty()^1){int u = que.pop();for(int i = head[u]; ~i; i = nxt[i]){register int v=to[i],c=cap[i^1],f=flow[i^1];if(!vis[v]&&c>f){vis[v]=1;dis[v]=dis[u]+1;que.push(v);}}}
}
int aug(){int u=t,ans=oo;while(u!=s){ans=min(ans,cap[pre[u]]-flow[pre[u]]);u=to[pre[u]^1];}u=t;while(u!=s){flow[pre[u]]+=ans;flow[pre[u]^1]-=ans;u=to[pre[u]^1];}return ans;
}
int isap(){int ans=0;bfs();memset(gap,0,sizeof gap);memcpy(cur,head,sizeof head);for(int i = 1; i <= n; i++) gap[dis[i]]++;int u = s;while(dis[s]<n){if(u==t){ans+=aug();u=s;}bool ok=0;for(int i = cur[u]; ~i; i = nxt[i]){int v=to[i],c=cap[i],f=flow[i];if(c>f&&dis[u]==dis[v]+1){ok=1;pre[v]=i;cur[u]=i;u=v;break;}}if(!ok){int mn=n-1;for(int i = head[u]; ~i; i = nxt[i]){int v=to[i],c=cap[i],f=flow[i];if(c>f) mn=min(mn,dis[v]);}if(--gap[dis[u]]==0) break;dis[u]=mn+1;gap[dis[u]]++;cur[u]=head[u];if(u!=s) u=to[pre[u]^1];}}return ans;
}
int main(){int T,kase=0,R,C,a[maxn],b[maxn],G[50][50]; scan(T);while(T--){scann(R,C);rep(i,1,R) scanf("%d",&a[i]);rep(i,1,C) scanf("%d",&b[i]);rrep(i,R,1) a[i]=a[i]-a[i-1];rrep(i,C,1) b[i]=b[i]-b[i-1];init();s=R+C+1;t=s+1;n=t;rep(i,1,R) add(s,i,a[i]-C);rep(i,1,C) add(i+R,t,b[i]-R);rep(i,1,R)rep(j,1,C)add(i,j+R,19);int ans=isap();rep(i,1,R){repe(j,i){int v=to[j],c=cap[j],f=flow[j];if(c==0||v==s)continue;G[i][v-R]=flow[j]+1;}}printf("Matrix %d\n",++kase);rep(i,1,R){rep(j,1,C){if(j!=C) printbk(G[i][j]);else println(G[i][j]);}}if(T) printf("\n");}return 0;
}