#include <fstream>
#include <queue>
#define INF 999999999
#define NMAX 1005

using namespace std;

FILE* f=freopen("maxflow.in","r",stdin);
FILE* o=freopen("maxflow.out","w",stdout);

int n,m;
int flow;
int father[NMAX];
int cap[NMAX][NMAX];
inline void INIT(int a[],int v, int n)
{
    for(int i=0;i<=n;++i) a[i]=0;
}
inline int minim(int a, int b) { return (a<b)?a:b; }
int MoreFlow()
{
    queue<int> q;
    INIT(father,0,n);

    q.push(1);
    father[1]=-1;
    int mincap=INF;
    int x;
    int foundSink=0;
    while(!q.empty()&&!foundSink)
    {
        x=q.front();
        q.pop();

        for(int i=1;i<=n;++i)
        {
            if(cap[x][i]>0&&!father[i])
            {
                father[i]=x;
                q.push(i);
                mincap=minim(mincap,cap[x][i]);
                if(i==n)
                {
                    foundSink=1;
                    break;
                }
            }
        }
    }
    if(mincap==INF||father[n]==0)
        return 0;
    x=n;
    int ft=father[x];
    while(ft!=-1)
    {
        cap[ft][x]-=mincap;
        cap[x][ft]+=mincap;
        x=ft;
        ft=father[x];
    }
    return mincap;
}

void MaxFlow()
{
    int found=0;
    do
    {
        found=MoreFlow();
        flow+=found;
    }
    while(found);
}

int main()
{
    scanf("%d%d",&n,&m);

    for(int i=0;i<m;++i)
    {
        int x,y,c;
        scanf("%d%d%d",&x,&y,&c);

        cap[x][y]=c;
    }

    MaxFlow();

    printf("%d",flow);

    return 0;
}