#include <fstream>
#include <iostream>
#include <climits>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");

struct edge{
    int capacity, flow;
};

int n, m, x, y, c;
edge matrix[1005][1005];
queue<int> q;
int father[1005];
vector<int> ad[1005];
int source, destination;

bool explored[1005];

int bfs() {

    for(int i = 1; i <= n; i++) {
        father[i] = 0;
        explored[i] = 0;
    }

    explored[source] = 1;
    q.push(source);

    while(!q.empty()) {
        int node = q.front();
        q.pop();

        if(node == destination)
            continue;

        for(auto i : ad[node]) {
            if(matrix[node][i].flow < matrix[node][i].capacity && explored[i] == 0) {
                explored[i] = 1;
                q.push(i);
                father[i] = node;
            }
        }
    }

    if(explored[destination] == 0)
        return 0; // destination can't be reached!
    else
        return 1; // destination reached!
}


int main() {
    fin >> n >> m;

    for (int i = 1; i <= m; i++ )
    {
        fin >> x >> y >> c;
        matrix[x][y].capacity = c;
        ad[x].push_back(y);
        ad[y].push_back(x);
    }

    source = 1;
    destination = n;
    int max_flow = 0;

    while(bfs()) {

        int min_flow = INT_MAX;
        for(auto vec : ad[destination]) {
            if(explored[vec] == 0 || matrix[vec][destination].flow == matrix[vec][destination].capacity)
                continue;

            int node = destination;
            father[destination] = vec;

            while(father[node] != 0) {
                min_flow = min(min_flow, matrix[father[node]][node].capacity - matrix[father[node]][node].flow);
                node = father[node];
            }
            node = destination;
            max_flow += min_flow;

            while(father[node] != 0) {
                matrix[father[node]][node].flow += min_flow;
                matrix[node][father[node]].flow -= min_flow;
                node = father[node];
            }
        }
        // calculate the maximal flow that can be pushed through this path

    }

    fout<< max_flow;
    return 0;
}