#include <bits/stdc++.h>

using namespace std;

ifstream fin("maxflow.in");
ofstream fout("maxflow.out");

const int nmax=1005;
int n,m;
int flow[nmax][nmax],cap[nmax][nmax];
vector<int> vecini[nmax];
bool vizitat[nmax];
queue<int> q;
int tata[nmax];

bool bfs()
{
    memset(vizitat,0,sizeof vizitat);
    q.push(1);
    while(!q.empty())
    {
        int i=q.front();
        q.pop();
        if(i==n) continue;
        for(auto pi: vecini[i])
        {
            if(!vizitat[pi] && flow[i][pi]<cap[i][pi])
            {
                vizitat[pi]=1;
                tata[pi]=i;
                q.push(pi);
            }
        }
    }
    return vizitat[n];
}

int main()
{
    fin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        int x,y,c;
        fin>>x>>y>>c;
        vecini[x].push_back(y);
        vecini[y].push_back(x);
        cap[x][y]=c;
    }
    long long FLOW=0;
    while(bfs())
    {
        for(auto vn: vecini[n])
        {
            tata[n]=vn;
            int flowmin=INT_MAX;
            for(int nod=n; nod!=1; nod=tata[nod])
            {
                flowmin=min(flowmin,cap[tata[nod]][nod]-flow[tata[nod]][nod]);
            }
            if(flowmin==0) continue;
            for(int nod=n; nod!=1; nod=tata[nod])
            {
                flow[tata[nod]][nod]+=flowmin;
                flow[nod][tata[nod]]-=flowmin;
            }
            FLOW+=flowmin;
        }
    }
    fout<<FLOW;
    return 0;
}