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

using namespace std;

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

    pos.clear();
    level.clear();
    g.clear();
    edges.clear();

    pos.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({c, b});
    edges.push_back({0, a});
  }
  int dfs(int a, int cap) {
    if (!cap || a == n) {
      return cap;
    }
    while (pos[a] < (int) g[a].size()) {
      int i = g[a][pos[a]++];
      if (edges[i].cap > 0) {
        int x = dfs(edges[i].to, min(cap, edges[i].cap));
        if (x > 0) {
          edges[i].cap -= x;
          edges[i ^ 1].cap += x;
          return x;
        }
      }
    }
    return 0;
  }
  int get() {
    int sol = 0;
    while (1) {
      for (int i = 1; i <= n; i++) {
        level[i] = -1;
        pos[i] = 0;
      }
      level[1] = 0;
      queue<int> q;
      q.push(1);
      while (!q.empty()) {
        int a = q.front();
        q.pop();
        for (auto &ind : g[a]) {
          int b = edges[ind].to;
          if (edges[ind].cap > 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;
        }
        sol += x;
      }
    }
    return sol;
  }
};

int main() {
  freopen ("maxflow.in", "r", stdin);
  freopen ("maxflow.out", "w", stdout);
  int n, m;
  cin >> n >> m;
  flow f;
  f.init(n);
  while (m--) {
    int a, b, c;
    cin >> a >> b >> c;
    f.add(a, b, c);
  }
  cout << f.get() << "\n";
  return 0;
}