#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <fstream>
#include <cstring>
using namespace std;

ifstream F("maxflow.in");
ofstream G("maxflow.out");

const int N = 1010;

int n,m,cap[N][N],dad[N];
vector<int> v[N];

int go()
{
    memset(dad,0,sizeof(dad));
    dad[1] = -1;

    stack<int> vt;
    vt.push(1);
    while ( !vt.empty() )
    {
        int x = vt.top();
        vt.pop();

        for (int i=0;i<int(v[x].size());++i)
        {
            int y = v[x][i];
            if ( dad[y] == 0 && cap[x][y] > 0 )
            {
                dad[y] = x;
                vt.push(y);
            }
        }
    }

    return dad[n];
}

int main()
{
    F>>n>>m;
    for (int i=1,x,y,c;i<=m;++i)
    {
        F>>x>>y>>c;
        cap[x][y] = c;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    int flow = 0;
    while ( go() )
        for (int i=0;i<int(v[n].size());++i)
        {
            int x = v[n][i];
            if ( dad[x] != 0 && cap[x][n] > 0 )
            {
                int cp = cap[x][n];
                for (int j=x;j!=1;j=dad[j]) cp = min(cp,cap[dad[j]][j]);
                for (int j=x;j!=1;j=dad[j])
                {
                    cap[dad[j]][j] -= cp;
                    cap[j][dad[j]] += cp;
                }
                cap[x][n] -= cp;
                flow += cp;
            }
        }
    G<<flow<<'\n';
}