#include <bits/stdc++.h>
using namespace std;

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

struct Edge {
    int v, flow, C, rev;
};

class Graph {
    int V;
    int* level;
    vector<Edge>* adj;

public:
    Graph(int V) {
        adj = new vector<Edge>[V];
        this->V = V;
        level = new int[V];
    }

    void addEdge(int u, int v, int C) {
        Edge a{ v, 0, C, (int)adj[v].size() };
        Edge b{ u, 0, 0, (int)adj[u].size() };

        adj[u].push_back(a);
        adj[v].push_back(b);
    }

    bool BFS(int s, int t);
    int sendFlow(int s, int flow, int t, int ptr[]);
    int DinicMaxflow(int s, int t);
};

bool Graph::BFS(int s, int t) {
    for (int i = 0; i < V; i++)
        level[i] = -1;

    level[s] = 0;
    list<int> q;
    q.push_back(s);

    vector<Edge>::iterator i;
    while (!q.empty()) {
        int u = q.front();
        q.pop_front();
        for (i = adj[u].begin(); i != adj[u].end(); i++) {
            Edge& e = *i;
            if (level[e.v] < 0 && e.flow < e.C) {
                level[e.v] = level[u] + 1;

                q.push_back(e.v);
            }
        }
    }
    return level[t] < 0 ? false : true;
}

int Graph::sendFlow(int u, int flow, int t, int start[]) {
    if (u == t)
        return flow;

    for (; start[u] < adj[u].size(); start[u]++) {
        Edge& e = adj[u][start[u]];

        if (level[e.v] == level[u] + 1 && e.flow < e.C) {
            int curr_flow = min(flow, e.C - e.flow);

            int temp_flow = sendFlow(e.v, curr_flow, t, start);

            if (temp_flow > 0) {
                e.flow += temp_flow;

                adj[e.v][e.rev].flow -= temp_flow;
                return temp_flow;
            }
        }
    }

    return 0;
}

int Graph::DinicMaxflow(int s, int t) {
    if (s == t)
        return -1;

    int total = 0;

    while (BFS(s, t) == true) {
        int* start = new int[V + 1]{ 0 };

        while (int flow = sendFlow(s, INT_MAX, t, start))
            total += flow;
    }

    return total;
}

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

    Graph g(n + 1);

    for(int x, y, cap, i = 1; i <= m; i++) {
        fin >> x >> y >> cap;
        g.addEdge(x, y, cap);
    }

    fout << g.DinicMaxflow(1, n);
    
    fout.close();
    return 0;
}