<span style="font-size:24px;">#include<stdio.h>
#include<algorithm>
#include<queue>
#define INF 1000
#define min(x,y) (x<y?x:y)
using namespace std;
int cap[20][20],flow[20][20],a[1000],p[100];
int n,m,f,s,t;

void Edmonds_Karp()
{
	queue<int> q;
	memset(flow,0,sizeof(flow));
	f=0;
	s=1;
	t=n;
	while(1)
	{
		memset(a,0,sizeof(a));
		a[s]=INF;
		q.push(s); 
		while(!q.empty())
		{
			int u=q.front();
			q.pop();
			for(int v=1;v<=n;v++)
			{
				if(!a[v]&&cap[u][v]>flow[u][v])
				{
					p[v]=u;
					q.push(v);
					a[v]=min(a[u],cap[u][v]-flow[u][v]);
				}
			}
		}
		if(a[t]==0) break;	
		for(int u=t;u!=s;u=p[u])
		{
			flow[p[u]][u]+=a[t];
			flow[u][p[u]]-=a[t];
		}
		f+=a[t];
	}
}

int main()
{
	int t,k=1;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d %d",&n,&m);
		memset(cap,0,sizeof(cap));
		for(int i=0;i<m;i++)
		{
			int x,y,c;
			scanf("%d %d %d",&x,&y,&c);
			cap[x][y]+=c;
		}
		Edmonds_Karp();
		printf("Case %d: %d\n",k++,f);
	}
	return 0;
}</span>