#include <cstring>
#include <fstream>
#include <queue>
#define MAX 1010

using namespace std;

int x, y, z, i, n, m, flow, solFlow, from[MAX], cap[MAX][MAX];
queue<int>Q;

bool BF()
{
    memset(from, 0, sizeof(from));
    from[1] = -1;
    Q.push(1);
    while(!Q.empty())
    {
        x = Q.front();
        Q.pop();
        for(i = 1; i <= n; i++)
            if(cap[x][i] and !from[i])
            {
                from[i] = x;
                Q.push(i);
            }
    }
    return from[n];
}
int main()
{
    ifstream fi("maxflow.in");
    ofstream fo("maxflow.out");
    fi >> n >> m;
    for(i = 1; i <= m; i++)
    {
        fi >> x >> y >> z;
        cap[x][y] = z;
        cap[y][x] = 0;
    }
    while(BF())
    {
        flow = int(2e9);
        for(i = n; from[i] != -1; i = from[i])
            flow = min(flow, cap[from[i]][i]);
        for(i = n; from[i] != -1; i = from[i])
            cap[from[i]][i] -= flow, cap[i][from[i]] += flow;
        solFlow += flow;
    }
    fo << solFlow << "\n";
    return 0;
}