#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");
int cap[1005][1005], flux[1005][1005];
vector<int>adj[1005];
vector<int>tata(1005);
int n, m;
vector<bool>visited(1005);

int bfs()
{
        queue<int>q;
        q.push(1);

        for(int i = 0; i <= n; i++)
            visited[i] = false;

        while(!q.empty())
        {
            int vf = q.front();
            visited[vf] = true;
            q.pop();

            for(auto a : adj[vf])
            {
                if(cap[vf][a] != flux[vf][a] && !visited[a])
                {
                    q.push(a);
                    tata[a] = vf;
                    if(a == n)
                        return 1;
                }
            }
        }

        return 0;
}

int main()
{
    fin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        int x, y, c;
        fin >> x >> y >> c;
        cap[x][y] = c;
        adj[x].push_back(y);
        adj[y].push_back(x);
    }
    int fluxmax = 0, minflux;
    while(bfs())
    {
        for(auto a : adj[n])
        {
            minflux = 1e9 + 1;
            if(flux[a][n] != cap[a][n] && visited[a] == true)
            {
                tata[n] = a;
                for(int nod = n; nod != 1; nod = tata[nod])
                {
                    minflux = min(minflux, cap[tata[nod]][nod] - flux[tata[nod]][nod]);
                }

                if(minflux != 0)
                {
                    for(int nod = n; nod != 1; nod = tata[nod])
                    {
                        flux[tata[nod]][nod] += minflux;
                        flux[nod][tata[nod]] -= minflux;
                    }

                    fluxmax += minflux;
                }
            }
        }
    }

    fout << fluxmax;
    return 0;
}