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

class Edge{
public:
    int from;
    int to;
    int capacity;
    int flow;
    Edge* reverseEdge;

    Edge(int from, int to, int capacity, int flow = 0, Edge* reverseEdge = NULL):
         from(from), to(to), capacity(capacity), flow(flow), reverseEdge(reverseEdge){}

    ~Edge(){
        reverseEdge = NULL;
    }

    int getRemainingCapacity() const{
        return capacity - flow;
    }
};

class Graph{
public:
    const int N;
    vector<vector<Edge*>> edges;

public:
    Graph(const int& N): N(N){
        edges.resize(N);
    }

    ~Graph(){
        for(int i = 0; i < (int)edges.size(); ++i){
            for(int j = 0; j < (int)edges[i].size(); ++j){
                delete edges[i][j];
            }
        }
        edges.clear();
    }

    void addEdge(int from, int to, int c){
        Edge* edge1 = new Edge(from, to, c);
        Edge* edge2 = new Edge(to, from, 0);
        edge1->reverseEdge = edge2;
        edge2->reverseEdge = edge1;
        edges[from].push_back(edge1);
        edges[to].push_back(edge2);
    }
};

class Dinic{
private:
    const Graph& G;
    const int N;
    const int SRC;
    const int DEST;
    const int INF = 1e8;
    vector<int> dist;
    vector<int> startEdgeIdx;

    int bfs(){
        fill(dist.begin(), dist.end(), INF);
        
        queue<int> q;
        q.push(SRC);
        dist[SRC] = 0;
        while(!q.empty() && dist[DEST] == INF){
            int node = q.front();
            q.pop();

            for(Edge* edge: G.edges[node]){
                int node = edge->from;
                int nextNode = edge->to;
                if(edge->getRemainingCapacity() > 0 && dist[nextNode] == INF){
                    dist[nextNode] = 1 + dist[node];
                    q.push(nextNode);
                }
            }
        }

        return (dist[DEST] != INF);
    }

    int dfs(int node, int minDelta){
        if(node == DEST){
            return minDelta;
        }
        for(; startEdgeIdx[node] < (int)G.edges[node].size(); ++startEdgeIdx[node]){
            Edge* edge = G.edges[node][startEdgeIdx[node]];
            int nextNode = edge->to;
            if(edge->getRemainingCapacity() > 0 && dist[node] + 1 == dist[nextNode]){
                int delta = dfs(nextNode, min(minDelta, edge->getRemainingCapacity()));
                if(delta > 0){
                    edge->flow += delta;
                    edge->reverseEdge->flow -= delta;
                    return delta;
                }
            }
        }
        return 0;
    }

public:
    Dinic(const Graph& G, const int& SRC, const int& DEST):
          G(G), N(G.N), SRC(SRC), DEST(DEST){
    }

    int computeMaxFlow(){
        dist.resize(N);
        startEdgeIdx.resize(N);

        int maxFlow = 0;
        while(bfs()){
            fill(startEdgeIdx.begin(), startEdgeIdx.end(), 0);
            int delta = INF;
            while(delta > 0){
                delta = dfs(SRC, INF);
                maxFlow += delta;
            }
        }

        return maxFlow;
    }
};

int main(){
    ifstream cin("maxflow.in");
    ofstream cout("maxflow.out");

    int N, M;
    cin >> N >> M;

    Graph G(N);
    int x, y, c;
    for(int i = 0; i < M; ++i){
        cin >> x >> y >> c;
        G.addEdge(x - 1, y - 1, c);
    }

    cout << Dinic(G, 0, N - 1).computeMaxFlow();

    cin.close();
    cout.close();
    return 0;
}