#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

struct edge
{
    int y, cap, flow, rev;
};

vector<edge>v[1005];
int n, m;
pair<int,int> pred[1005];
queue<int>q;

void BFS()
{
    q.push(1);
    for (int i = 1; i <= n; i++)
        pred[i] = { 0 ,0 };
    while (!q.empty() && pred[n].first == 0)
    {
        int x = q.front();
        q.pop();
        for (int i=0;i<v[x].size();i++)
        {
            if (pred[v[x][i].y].first == 0 && v[x][i].y != 1 && v[x][i].cap > v[x][i].flow)
            {
                pred[v[x][i].y] = { x , i };
                q.push(v[x][i].y);
            }
        }
    }
    while (!q.empty()) q.pop();
}

int main()
{
    fin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        int x, y, c;
        fin >> x >> y >> c;
        v[x].push_back({ y,c,0,(int)v[y].size() });
        v[y].push_back({ x,c,0,(int)v[x].size() - 1 });
    }
    int flux = 0;
    do
    {
        BFS();
        if (pred[n].first != 0)
        {
            int mn = 1e9;
            for (pair<int, int> x = pred[n]; x.first != 0; x = pred[x.first])
                mn = min(mn, v[x.first][x.second].cap - v[x.first][x.second].flow);
            for (pair<int, int> x = pred[n]; x.first != 0; x = pred[x.first])
            {
                v[x.first][x.second].flow += mn;
                v[v[x.first][x.second].y][v[x.first][x.second].rev].flow -= mn;
            }
            flux += mn;
        }
    } while (pred[n].first != 0);
    fout << flux << "\n";
    return 0;
}