#include <stdio.h>

#define NMAX 1000

int n, m;
short g[NMAX][NMAX];
int capacity[NMAX][NMAX];
short queue[NMAX], top, parent[NMAX];

inline const int& min(const int& x, const int& y)
{
    return (x < y ? x : y);
}

bool bfs()
{
    for(int i = 0; i < n; i++)
        parent[i] = -1;
    
    parent[0] = -2;
    queue[0] = 0;
    top = 1;
    for(int i = 0; i < top; i++)
    {
        short u = queue[i];
        for(int i = 1; i <= g[u][0]; i++)
        {
            short v = g[u][i];
            if(parent[v] == -1 && capacity[u][v])
            {
                parent[v] = u;
                queue[top++] = v;
            }
        }
    }

    return parent[n - 1] != -1;
}

int main()
{
    freopen("maxflow.in", "r", stdin);
    freopen("maxflow.out", "w", stdout);

    scanf("%d %d", &n, &m);
    for(int i = 0; i < m; i++)
    {
        int u, v, w;
        scanf("%d %d %d", &u, &v, &w);
        u--; v--;
        capacity[u][v] = w;
        g[u][++g[u][0]] = v;
        g[v][++g[v][0]] = u;
    }

    int flow = 0;
    while(bfs())
    {
        for(int i = 1; i <= g[n - 1][0]; i++)
        {
            int node = g[n - 1][i];
            if(parent[node] != -1)
            {
                parent[n - 1] = node;

                int maxflow = 0x3f3f3f3f;
                for(node = n - 1; node != 0; node = parent[node])
                    maxflow = min(maxflow, capacity[parent[node]][node]);
                
                if(maxflow == 0)
                    continue;
                flow += maxflow;
                
                for(node = n - 1; node != 0; node = parent[node])
                {
                    capacity[parent[node]][node] -= maxflow;
                    capacity[node][parent[node]] += maxflow;
                }
            }
        }
    }
    printf("%d\n", flow);
    return 0;
}