#include<fstream>
#include<queue>
#include<cstring>
using namespace std;
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");
int d[1010],c[1010][1010],a,b,cap,flux,sol,n,m,i;
queue<int> q;
vector<int> v[1010];
int bfs()
{
    int nod;
    memset(d,0,sizeof(d));q.push(1);d[1]=1;
    while(!q.empty())
    {
        nod=q.front();q.pop();
        for(auto it:v[nod])
            if(d[it]==0&&c[nod][it])
            {
                d[it]=d[nod]+1;
                q.push(it);
            }
    }
    return d[n];
}

int dfs(int nod,int cap)
{
    if(cap==0) return 0;if(nod==n) return cap;
    int bag=0,r;
    for(auto it:v[nod])
        if(d[nod]+1==d[it]&&c[nod][it]>=0)
        {
            r=dfs(it,min(cap-bag,c[nod][it]));
            c[nod][it]-=r;
            c[it][nod]+=r;
            bag+=r;
        }
    return bag;
}

int main()
{
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>a>>b>>cap;
        v[a].push_back(b);v[b].push_back(a);
        c[a][b]=cap;
    }
    while(bfs())
    {
        while(true)
        {
            flux=dfs(1,1000000000);
            if(flux<=0) break;
            sol+=flux;
        }
    }
    fout<<sol;
    return 0;
}