#include<cstdio>

 #include<cstring>

 #include<algorithm>

 #include<queue>

 using namespace std;

 #define INF 2147483647

 #define MAXN 20011

 #define MAXM 600301

 int v[MAXM],cap[MAXM],en,first[MAXN],next[MAXM];

 int d[MAXN],cur[MAXN];

 queue<int>q;

 int n,m,S,T;

 void Init_Dinic(){memset(first,-,sizeof(first)); en=;}

 void AddEdge(const int &U,const int &V,const int &W)

 {

     v[en]=V; cap[en]=W;

     next[en]=first[U]; first[U]=en++;

     v[en]=U; cap[en]=0;

     next[en]=first[V]; first[V]=en++;

 }

 bool bfs()

 {

     memset(d,-,sizeof(d)); q.push(S); d[S]=;

     while(!q.empty())

       {

           int U=q.front(); q.pop();

           for(int i=first[U];i!=-;i=next[i])

             if(d[v[i]]==- && cap[i])

               {

                 d[v[i]]=d[U]+;

                 q.push(v[i]);

               }

       }

     return d[T]!=-;

 }

 int dfs(int U,int a)

 {

     if(U==T || !a) return a;

     int Flow=,f;

     for(int &i=cur[U];i!=-;i=next[i])

       if(d[U]+==d[v[i]] && (f=dfs(v[i],min(a,cap[i]))))

         {

           cap[i]-=f; cap[i^]+=f;

           Flow+=f; a-=f; if(!a) break;

         }

     if(!Flow) d[U]=-;

     return Flow;

 }

 int max_flow()

 {

     int Flow=,tmp=;

     while(bfs())

       {

           memcpy(cur,first,(n+)*sizeof(int));

           while(tmp=dfs(S,INF)) Flow+=tmp;

       }

     return Flow;

 }