#include <cstdio>
#include <queue>

using namespace std;

struct Edge {
  int to;
  int c;
};

const int N = 1000 + 7;
const int M = 5000 + 7;
int n;
int m;
int level[N];
vector<int> g[N];
Edge e[2 * M];
int ans;

int dfs(int a, int cap) {
  if (cap == 0 || a == n) {
    return cap;
  }
  for (auto &i : g[a]) {
    int b = e[i].to;
    if (level[b] != level[a] + 1) {
      continue;
    }
    int c = e[i].c;
    int val = dfs(b, min(cap, c));
    if (val > 0) {
      e[i].c -= val;
      e[i ^ 1].c += val;
      return val;
    }
  }
  return 0;
}

int main() {
  freopen ("maxflow.in", "r", stdin);
  freopen ("maxflow.out", "w", stdout);

  scanf("%d %d", &n, &m);
  for (int i = 0; i < m; i++) {
    int a, b, c;
    scanf("%d %d %d", &a, &b, &c);
    e[2 * i] = {b, c};
    e[2 * i + 1] = {a, 0};
    g[a].push_back(2 * i);
    g[b].push_back(2 * i + 1);
  }
  while (1) {
    for (int i = 1; i <= n; i++) {
      level[i] = -1;
    }
    queue<int> q;
    level[1] = 0;
    q.push(1);
    while (!q.empty()) {
      int a = q.front();
      q.pop();
      for (auto &i : g[a]) {
        int b = e[i].to;
        int c = e[i].c;
        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, (int) 1e9);
      if (x) {
        ans += x;
      } else {
        break;
      }
    }

  }
  printf("%d\n", ans);
}