#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit(b) (1ll << (b))
#define uniq(v) (v).erase(unique(all(v)), (v).end())
#define rsort(v) sort(all(v)); reverse(all(v))

using namespace std;

using i32 = int;
using i64 = long long;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
using vf80 = vector<f80>;
using vstr = vector<string>;

inline void yes() { cout << "Yes" << '\n'; exit(0); }
inline void no() { cout << "No" << '\n'; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { return a / gcd(a, b) * b; }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }
template<typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template<typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template<typename T> inline void amax(T &x, T y) { if (x < y) x = y; }
template<typename T> inline void amin(T &x, T y) { if (x > y) x = y; }
template<typename T> inline T power(T x, i64 n) { T r = 1; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template<typename T> istream& operator>>(istream &is, vector<T> &v) { for (auto &x : v) is >> x; return is; }
template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }

template <typename C, typename D>
struct Graph {
  struct Edge {
    int to;
    C cap;
    D cost;
    int rev;
  };
  vector<vector<Edge>> edges;
  int n;
  Graph(int n) : n(n) {
    edges = vector<vector<Edge>>(n);
  }
  void add_edge(int from, int to, C cap = 1, D cost = 0) {
    edges[from].push_back((Edge) { to, cap, cost, (int) edges[to].size() });
    edges[to].push_back((Edge) { from, 0, -cost, (int) edges[from].size() - 1 });
  }
};

template <typename C, typename D>
C max_flow(Graph<C, D> &g, int s, int t) {
  const int n = g.n;
  auto &G = g.edges;

  C flow = 0;
  vector<int> used(n);
  int ui = 0;
  function<C(int, int, C)> dfs = [&](int v, int t, C f) {
    if (v == t) return f;
    used[v] = ui;
    for (int i = 0; i < G[v].size(); i++) {
      auto &e = G[v][i];
      if (used[e.to] == ui || e.cap == 0) continue;
      int d = dfs(e.to, t, min(f, e.cap));
      if (d == 0) continue;
      e.cap -= d;
      G[e.to][e.rev].cap += d;
      return d;
    }
    return 0;
  };
  while (true) {
    ui++;
    int f = dfs(s, t, numeric_limits<C>::max());
    if (f == 0) return flow;
    flow += f;
  }
}

template <typename C, typename D>
D min_cost_flow(Graph<C, D> &g, int s, int t, C f) {
  const D INF = numeric_limits<D>::max();
  const int n = g.n;
  auto &G = g.edges;

  D ret = 0;
  while (f > 0) {
    vector<D> dist(n, INF);
    vector<int> prevv(n), preve(n);
    dist[s] = 0;
    while (true) {
      bool update = false;
      rep(v, n) rep(i, G[v].size()) {
        auto &e = G[v][i];
        if (e.cap == 0) continue;
        if (dist[v] == INF || dist[e.to] <= dist[v] + e.cost) continue;
        dist[e.to] = dist[v] + e.cost;
        prevv[e.to] = v, preve[e.to] = i;
        update = true;
      }
      if (!update) break;
    }
    if (dist[t] == INF) return INF;
    C cap = f;
    for (int v = t; v != s; v = prevv[v]) {
      cap = min(cap, G[prevv[v]][preve[v]].cap);
    }
    f -= cap;
    ret += cap * dist[t];
    for (int v = t; v != s; v = prevv[v]) {
      auto &e = G[prevv[v]][preve[v]];
      e.cap -= cap;
      G[v][e.rev].cap += cap;
    }
  }
  return ret;
}

void solve() {
  int V, E; cin >> V >> E;
  auto g = Graph<int, int>(V);
  rep(i, E) {
    int u, v, c; cin >> u >> v >> c;
    g.add_edge(u, v, c);
  }
  cout << max_flow(g, 0, V - 1) << '\n';
}



Measured memory_bytes: 3228