#include <fstream>
#include <vector>
#include <queue>
#define INF (1<<30)
#define nmax 1004
using namespace std;

ifstream in("flux.in");
ofstream out("flux.out");

vector<int> V[nmax];
queue<int> Q;
int C[nmax][nmax],T[nmax];
int N,M;

inline int _min(int a,int b){if(a<b)return a;return b;}

inline bool BFS()
{
    int i,x,y;
    for(i=0;i<=N;i++)T[i]=0;
    while(!Q.empty())Q.pop();
    Q.push(1);
    while(!Q.empty())
    {
        x = Q.front();
        Q.pop();
        for(i=0;i<V[x].size();i++)
        {
            y = V[x][i];
            if(C[x][y]&&!T[y])
            {
                T[y]=x,Q.push(y);
                if(y==N)
                    return 1;
            }
        }
    }
    return 0;
}

int main()
{
    int i,x,y,c,m,flux=0;
    in>>N>>M;
    while(M--)
    {
        in>>x>>y>>c;
        C[x][y]+=c;
        V[x].push_back(y);
        V[y].push_back(x);
    }

    //plec din 1 si ajung in N
    bool am_drum = 1;
    while(BFS())
    {
        for(i=0;i<V[N].size();i++)
        {
            x = V[N][i];
            if(!T[x]||!C[x][N])continue;
            T[N]=x;
            x = N;
            m = INF;
            while(x!=1)//determin muchia minima
                m=_min(m,C[T[x]][x]),x = T[x];
            if(!m)continue;
            x = N;
            while(x!=1)
                C[T[x]][x]-=m,C[x][T[x]]+=m,x=T[x];
            flux+=m;
        }
        //return 12;
    }
    out<<flux<<'\n';
    return 0;
}