#include<stdio.h>

 #include<string.h>

 #include<queue>

 #include<vector>

 #include<algorithm>

 using namespace std;

 const int maxm=+;

 const int INF=0x3f3f3f3f;

 struct edge{

     int from,to,c,f;

     edge(int a,int b,int m,int n):from(a),to(b),c(m),f(n){}

 };

 struct ek{

     int n,m;

     vector<edge>e;

     vector<int>g[maxm];

     int a[maxm];

     int p[maxm];

     void init(int n){

         for(int i=;i<n+;i++)g[i].clear();

         e.clear();

     }

     void add(int from,int to,int c){

         e.push_back(edge(from,to,c,));

         e.push_back(edge(to,from,,));

         m=e.size();

         g[from].push_back(m-);

         g[to].push_back(m-);

     }

     int mf(int s,int t){

         int f=;

         while(){

             memset(a,,sizeof(a));

             queue<int>q;

             q.push(s);

             a[s]=INF;

             while(!q.empty()){

                 int u=q.front();

                 q.pop();

                 for(int i=;i<g[u].size();i++){

                     edge tmp=e[g[u][i]];

                     if(!a[tmp.to]&&tmp.c>tmp.f){

                         p[tmp.to]=g[u][i];

                         a[tmp.to]=min(a[u],tmp.c-tmp.f);

                         q.push(tmp.to);

                     }

                 }

                 if(a[t])break;

             }

             if(!a[t])break;

             for(int i=t;i!=s;i=e[p[i]].from){

                 e[p[i]].f+=a[t];

                 e[p[i]^].f-=a[t];

             }

             f+=a[t];

         }

         return f;

     }

 };