#include<cstdio>
#include<vector>
#define minim(a,b) a<b?a:b
using namespace std;
const int N=1005,INF=2000000000;
int n,ft,minf,tata[N],cap[N][N],flux[N][N];
bool f[N],viz[N];
vector<int> L[N];
void read()
{
    int m,x,y,c;
    freopen("maxflow.in","r",stdin);
    freopen("maxflow.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d%d",&x,&y,&c);
        cap[x][y]=c, L[x].push_back(y);
        cap[y][x]=0, L[y].push_back(x);
    }
}
bool drum(int st,int fin)
{
    viz[st]=true;
    if(st==fin)
        return true;
    for(vector<int>::iterator it=L[st].begin();it!=L[st].end();it++)
        if(!viz[*it] && flux[st][*it]<cap[st][*it])
        {
            tata[*it]=st;
            if(drum(*it,fin))
            {
                minf=minim(minf,cap[st][*it]-flux[st][*it]);
                return true;
            }
        }
    return false;
}
void reset()
{
    for(int i=1;i<=n;i++)
    {
        viz[i]=false;
        tata[i]=0;
    }
    minf=INF;
}
void propaga_flux(int nod)
{
    if(nod==0)
        return;
    propaga_flux(tata[nod]);
    flux[tata[nod]][nod]+=minf;
    flux[nod][tata[nod]]-=minf;
}
void solve()
{
    while(drum(1,n))
    {
        ft+=minf;
        propaga_flux(n);
        reset();
    }
}
int main()
{
    read();
    solve();
    printf("%d",ft);
    return 0;
}