#include
#define?ll?long?long?
using?namespace?std;
const?int?inf=2147483640;
const?int?mxn=11111;
int?nmst;
struct?edge{int?tocaprev;};
vectorg[mxn];
int?lev[mxn]iter[mxn];
inline?void?add_edge（int?fromint?toint?cap）{
	g[from].push_back（（edge）{tocapg[to].size（）}）;
	g[to].push_back（（edge）{from0g[from].size（）-1}）;
}
inline?void?bfs（）{
	memset（lev-1sizeof（lev））;
	queueq;
	lev[s]=0;
	q.push（s）;
	while（q.size（））{
		int?v=q.front（）;q.pop（）;
		for（int?i=0;i			edge&e=g[v][i];
			if（e.cap>0?and?lev[e.to]<0）{
				lev[e.to]=lev[v]+1;
				q.push（e.to）;
			}
		}
	}
}
int?dfs（int?vint?tint?f）{
	if（v==t）return?f;
	for（int&i=iter