// May this submission get accepted
#include <bits/stdc++.h>

// エイリアス
using  ll = long signed long;
using ull = long unsigned long;
using  ld = long double;
using namespace std;

// AtCoder/Codeforces 用 デバッグ検知
#ifdef ONLINE_JUDGE
constexpr bool DEBUG_MODE = false;
#else
constexpr bool DEBUG_MODE = true;
#endif

// エイリアス (補完・コンパイルが重くなる)
// #include <boost/multiprecision/cpp_int.hpp>
// using mll = boost::multiprecision::cpp_int;

// 汎用マクロ
#define ALL_OF(x) (x).begin(), (x).end()
#define REP(i,n) for (long long i=0, i##_len=(n); i<i##_len; i++)
#define RANGE(i,is,ie) for (long long i=(is), i##_end=(ie); i<=i##_end; i++)
#define DSRNG(i,is,ie) for (long long i=(is), i##_end=(ie); i>=i##_end; i--)
#define STEP(i, is, ie, step) for (long long i=(is), i##_end=(ie), i##_step = (step); i<=i##_end; i+=i##_step)
#define UNIQUE(v) do { sort((v).begin(), (v).end()); (v).erase(unique((v).begin(), (v).end()), (v).end()); } while (false)
#define FOREACH(i,q) for (auto &i : q)
template<class T> bool chmax(T &a, const T b) { if (a < b) {a = b; return true;} return false; }
template<class T> bool chmin(T &a, const T b) { if (a > b) {a = b; return true;} return false; }
constexpr int INF = numeric_limits<int>::max();
constexpr long long LINF = numeric_limits<long long>::max();
constexpr long double EPS = 1e-10L;
#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE")
#define IIF(q,t,f) ((q) ? (t) : (f))
#define DUMP(q) DUMP_FUNC(q, #q, __FILE__, __LINE__)
template <typename T> void DUMP_PROC(T x) { if (is_integral<T>() || is_floating_point<T>()) cerr << "\e[32m" << x << "\e[m"; else cerr << x; }
template<> void DUMP_PROC<char>(char x) { cerr << "\e[36m\'" << x << "\'\e[m"; }
template<> void DUMP_PROC<string>(string x) { cerr << "\e[33m\"" << x << "\"\e[m"; }
template <typename T, typename U> void DUMP_PROC(pair<T, U> x) { cerr << "{"; DUMP_PROC(x.first); cerr << ", "; DUMP_PROC(x.second); cerr << "}"; }
template <typename ...T, typename U, U... Seq> void DUMP_PROC(tuple<T...> &x, integer_sequence<U, Seq...>) { (void)(int[]){(cerr << ((const char*[]){"", ", "})[!!Seq] << (DUMP_PROC(get<Seq>(x)), ""), 0)...}; }
template <typename ...T> void DUMP_PROC(tuple<T...> x) {cerr << "{"; DUMP_PROC(x, index_sequence_for<T...>()); cerr << "}";}
template <typename T> void DUMP_PROC(vector<T> x) { cerr << "["; for (auto &xi : x) { DUMP_PROC(xi); cerr << (&xi != &*x.rbegin()?", ":""); } cerr << "]"; }
template <typename T> void DUMP_FUNC(T x, const char* name, const char* fn, int ln) { cerr << "\e[32m[DEBUG]\e[m " << name << ": "; DUMP_PROC(x); cerr << " @ " << fn << "(" << ln << ")" << endl; }

// gcc拡張マクロ
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll

// 標準入出力
struct qin { // query input
    size_t sz;
    qin(size_t _sz = 1) : sz(_sz) {}
    template <typename T> operator T () const { T a; cin >> a; return a; }
    template <typename T> operator vector<T> () const { vector<T> a(sz); for (size_t i = 0; i < sz; i++) cin >> a[i]; return a; }
    template <typename T, typename U> operator pair<T, U> () const { T f; U s; cin >> f >> s; return pair<T, U>(f, s); }
};
qin in1; // input one
template <typename T> void say(const T x, const char* end = "\n") { cout << x << end; }
void say(const ld x, const char* end = "\n") { cout << setprecision(30) << x << end; }
template <typename T> void say(const vector<T> x, const char* sep = " ", const char* end = "\n") { REP(i, x.size()) { cout << x[i] << (i+1 == i_len ? end : sep); } }
template <typename T> void say(const vector<vector<T>> x, const char* sep = " ", const char* end = "\n") { REP(i, x.size()) { say(x[i], sep, end); } }

// モジュール
// [[LIBRARY]]

// Dinic法による最大流
// Capacityには必ず整数型を指定すること（そもそも理論的に停止しなかったり誤差で停止しなかったりする）
// BFSとDFSを組み合わせてO(EV^2)だが実用的にはもっと速いらしい
// 最大二部マッチングではO(E√V)，辺容量がすべて同じならばO(min{E^(1/2),V^(2/3)})
// <!> ちゃんとO(EV^2)になる最悪ケースが知られている
// Verified on https://atcoder.jp/contests/abc010/tasks/abc010_4
template <typename Capacity>
struct dinic {
    using edge = tuple<size_t, Capacity, size_t>; // {to, cap, rev idx at g[to]}
    size_t n;
    vector<vector<edge>> g;
    vector<size_t> level, iter;
    dinic() : n(0), g(), level(), iter() {}
    dinic(size_t _n) : n(_n), g(n), level(n), iter(n) {}
    void add_ark(size_t from, size_t to, Capacity cap) {
        assert(0 <= from && from < n && 0 <= to && to < n);
        assert(cap >= 0);
        g[from].emplace_back(to  , cap, g[to  ].size());
        g[to  ].emplace_back(from,   0, g[from].size() - 1);
    }
    void bfs(size_t s) {
        constexpr ll ZINF = numeric_limits<size_t>::max();
        fill(ALL_OF(level), ZINF);
        deque<size_t> q = {s};
        level[s] = 0;
        while (q.size()) {
            size_t u = q.front(); q.pop_front();
            FOREACH(e, g[u]) {
                size_t v; Capacity cap; tie(v, cap, ignore) = e;
                if (cap > 0 && level[v] == ZINF) {
                    level[v] = level[u] + 1;
                    q.push_back(v);
                }
            }
        }
    }
    Capacity dfs(size_t v, size_t t, Capacity f) {
        if (v == t) return f;
        for (size_t &i = iter[v]; i < g[v].size(); i++) {
            edge     &e   = g[v][i];
            size_t   &to  = get<0>(e);
            Capacity &cap = get<1>(e);
            size_t   &rev = get<2>(e);
            if (cap <= 0 || level[v] >= level[to]) continue;
            Capacity d = dfs(to, t, min(f, cap));
            if (d > 0) {
                cap -= d;
                get<1>(g[to][rev]) += d;
                return d;
            }
        }
        return 0;
    }
    Capacity max_flow(size_t s, size_t t) {
        assert(0 <= s && s < n && 0 <= t && t < n);
        constexpr ll ZINF = numeric_limits<size_t>::max();
        if (s == t) return 0;
        Capacity f = 0;
        while (true) {
            bfs(s);
            if (level[t] == ZINF) return f;
            fill(ALL_OF(iter), 0);
            Capacity d;
            while ((d = dfs(s, t, numeric_limits<Capacity>::max())) > 0) {
                f += d;
            }
        }
    }
};

// 処理内容
int main() {
    
    ios::sync_with_stdio(false); // stdioを使うときはコメントアウトすること
    cin.tie(nullptr);            // インタラクティブ問題ではコメントアウトすること
    
    ll n, m; cin >> n >> m;
    dinic<ll> nf(n);
    REP(i, m) {
        ll u, v, c; cin >> u >> v >> c;
        nf.add_ark(u, v, c);
    }
    say(nf.max_flow(0, n-1));
    
}


Measured memory_bytes: 3248