#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>

using namespace std;

typedef long long ll;

struct flow {
  struct E {
    int to;
    int cap;
  };
  const int INF = (int) 1e9;
  int n;
  vector<vector<int>> g;
  vector<E> edges;
  vector<int> level;
  void init(int nn) {
    n = nn;
    g.clear();
    edges.clear();
    level.clear();
    level.resize(n + 1);
    g.resize(n + 1);
  }
  void add(int a, int b, int c) {
    g[a].push_back((int) edges.size());
    g[b].push_back((int) edges.size() + 1);
    edges.push_back({b, c});
    edges.push_back({a, 0});
  }
  int dfs(int a, int cap) {
    if (a == n || cap == 0) {
      return cap;
    }
    for (auto &i : g[a]) {
      int b = edges[i].to;
      int c = edges[i].cap;
      if (c == 0 || level[b] != level[a] + 1) {
        continue;
      }
      int x = dfs(b, min(cap, c));
      if (x == 0) {
        continue;
      }
      edges[i].cap -= x;
      edges[i ^ 1].cap += x;
      return x;
    }
    return 0;
  }
  int get() {
    int ret = 0;
    while (1) {
      level[1] = 0;
      for (int i = 2; i <= n; i++) {
        level[i] = -1;
      }
      queue<int> q;
      q.push(1);
      while (!q.empty()) {
        int a = q.front();
        q.pop();
        for (auto &i : g[a]) {
          int b = edges[i].to;
          int c = edges[i].cap;
          if (c > 0 && level[b] == -1) {
            level[b] = 1 + level[a];
            q.push(b);
          }
        }
      }
      if (level[n] == -1) {
        break;
      }
      while (1) {
        int x = dfs(1, INF);
        if (x == 0) {
          break;
        }
        ret += x;
      }
    }
    return ret;
  }
};

int main() {
  freopen ("maxflow.in", "r", stdin);
  freopen ("maxflow.out", "w", stdout);
  int n, m;
  cin >> n >> m;
  flow f;
  f.init(n);
  for (int i = 1; i <= m; i++) {
    int x, y, z;
    cin >> x >> y >> z;
    f.add(x, y, z);
  }
  cout << f.get() << "\n";
}