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

using namespace std;

struct flow {
  struct edge {
    int to;
    int cap;
  };
  const int INF = (int) 1e9;
  int n;
  vector<edge> edges;
  vector<vector<int>> g;
  vector<int> level;
  vector<int> pt;

  void init(int nn) {
    n = nn;
    edges.clear();
    pt.resize(n + 1);
    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 (cap == 0 || a == n) {
      return cap;
    }
    while (pt[a] < (int) g[a].size()) {
      int i = g[a][pt[a]++];
      if (edges[i].cap && level[edges[i].to] == 1 + level[a]) {
        int b = edges[i].to;
        int x = dfs(b, min(cap, edges[i].cap));
        if (x > 0) {
          edges[i].cap -= x;
          edges[i ^ 1].cap += x;
          return x;
        }
      }
    }
    return 0;
  }

  int get() {
    int ret = 0;
    while (1) {
      for (int i = 1; i <= n; i++) {
        level[i] = -1;
        pt[i] = 0;
      }
      level[1] = 0;
      queue<int> q;
      q.push(1);
      while (!q.empty()) {
        int a = q.front();
        q.pop();
        for (auto &i : g[a]) {
          if (edges[i].cap > 0) {
            int b = edges[i].to;
            if (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;
  scanf("%d %d", &n, &m);
  flow f;
  f.init(n);
  for (int i = 1; i <= m; i++) {
    int x, y, z;
    scanf("%d %d %d", &x, &y, &z);
    f.add(x, y, z);
  }
  printf("%d\n", f.get());

}