#include <bits/stdc++.h>
using namespace std;
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");
#define V 1005

bool bfs(int rGraph[V][V], int s, int t, int parent[])
{
    bool visited[V];
    memset(visited, 0, sizeof(visited));

    queue <int> q;
    q.push(s);
    visited[s] = true;
    parent[s] = -1;
    while (!q.empty())
    {
        int u = q.front();
        q.pop();
        for (int v = 0; v < V; v++)
            if (visited[v] == false && rGraph[u][v] > 0)
            {
                q.push(v);
                parent[v] = u;
                visited[v] = true;
            }
    }

    return visited[t] == true;
}
int fordFulkerson(int graph[V][V], int s, int t)
{
    int u, v;

    int rGraph[V][V]; 

    for (u = 0; u < V; u++)
        for (v = 0; v < V; v++)
            rGraph[u][v] = graph[u][v];
    int parent[V];  
    int max_flow = 0; 
    while (bfs(rGraph, s, t, parent))
    {

        int path_flow = INT_MAX;
        for (v = t; v != s; v = parent[v])
        {
            u = parent[v];
            path_flow = min(path_flow, rGraph[u][v]);
        }

        for (v = t; v != s; v = parent[v])
        {
            u = parent[v];
            rGraph[u][v] -= path_flow;
            rGraph[v][u] += path_flow;
        }
        max_flow += path_flow;
    }
    return max_flow;
}

    int graph[V][V];
int main()
{
    int n, m;
    fin >> n >> m;
    for (int i = 0; i < m; i++)
    {
        int u, v, c;
        fin >> u >> v >> c;
        graph[u - 1][v - 1] = c;
    }
    fout << fordFulkerson(graph, 0, n - 1);
    return 0;
}