#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <tuple>
#include <cstdio>
#include <bitset>
#include <sstream>
#include <iterator>
#include <numeric>
#include <map>
#include <cstring>
#include <set>
#include <functional>
#include <iomanip>

using namespace std;

#define DEBUG_ //!!提出時にコメントアウト!!
#ifdef DEBUG_
	#define dump(x)  cerr << #x << " = " << (x) << endl;
#else
	#define dump(x)  ;
#endif

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define SZ(x) ((int)(x).size())
#define pb push_back
#define eb emplace_back

//#define int long long

typedef long long LL;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;

template <typename T>
std::string printVector(const std::vector<T> &data)
{
    std::stringstream ss;
    std::ostream_iterator<T> out_it(ss, ", ");
    ss << "[";
    std::copy(data.begin(), data.end() - 1, out_it);
    ss << data.back() << "]";
    return ss.str();
}

const int MOD = 1e9+7;
const LL LINF = 1001002003004005006ll;
const int INF = 1001001001;

template< typename flow_t >
struct Dinic {
const flow_t INF;

struct edge {
    int to;
    flow_t cap;
    int rev;
    bool isrev;
};

vector< vector< edge > > graph;
vector< int > min_cost, iter;

Dinic(int V) : INF(numeric_limits< flow_t >::max()), graph(V) {}

void add_edge(int from, int to, flow_t cap) {
    graph[from].emplace_back((edge) {to, cap, (int) graph[to].size(), false});
    graph[to].emplace_back((edge) {from, 0, (int) graph[from].size() - 1, true});
}

bool bfs(int s, int t) {
    min_cost.assign(graph.size(), -1);
    queue< int > que;
    min_cost[s] = 0;
    que.push(s);
    while(!que.empty() && min_cost[t] == -1) {
    int p = que.front();
    que.pop();
    for(auto &e : graph[p]) {
        if(e.cap > 0 && min_cost[e.to] == -1) {
        min_cost[e.to] = min_cost[p] + 1;
        que.push(e.to);
        }
    }
    }
    return min_cost[t] != -1;
}

flow_t dfs(int idx, const int t, flow_t flow) {
    if(idx == t) return flow;
    for(int &i = iter[idx]; i < graph[idx].size(); i++) {
    edge &e = graph[idx][i];
    if(e.cap > 0 && min_cost[idx] < min_cost[e.to]) {
        flow_t d = dfs(e.to, t, min(flow, e.cap));
        if(d > 0) {
        e.cap -= d;
        graph[e.to][e.rev].cap += d;
        return d;
        }
    }
    }
    return 0;
}

flow_t max_flow(int s, int t) {
    flow_t flow = 0;
    while(bfs(s, t)) {
    iter.assign(graph.size(), 0);
    flow_t f = 0;
    while((f = dfs(s, t, INF)) > 0) flow += f;
    }
    return flow;
}

void output() {
    for(int i = 0; i < graph.size(); i++) {
    for(auto &e : graph[i]) {
        if(e.isrev) continue;
        auto &rev_e = graph[e.to][e.rev];
        cout << i << "->" << e.to << " (flow: " << rev_e.cap << "/" << e.cap + rev_e.cap << ")" << endl;
    }
    }
}
};

signed main(int argc, char const *argv[])
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int V,E; cin >> V >> E;
    Dinic<int> g(V);
    REP(i,E){
        int a,b,c; cin >> a >> b >> c;
        g.add_edge(a,b,c);
    }
    cout << g.max_flow(0,V-1) << endl;

}


Measured memory_bytes: 3276