#include <iostream>
#include <queue>
using namespace std;

const int NMAX = 1007;

int n, m;
int cap[NMAX][NMAX];
int par[NMAX];

bool bfs() {
  
  for (int u = 1; u <= n; u++) par[u] = -1;

  queue<int> q;
  q.push(1);
  par[1] = 0;

  while (!q.empty()) {
    int u = q.front();
    q.pop();
    for (int v = 1; v <= n; v++) {
      if (par[v] == -1 && cap[u][v] > 0) {
        par[v] = u;
        q.push(v);
      }
    }
  }

  return par[n] != -1;
}

void solve() {

  cin >> n >> m;

  for (int i = 0; i < m; i++) {
    int u, v, c;
    cin >> u >> v >> c;
    cap[u][v] = c;
  }

  long long total_flow = 0;

  while (bfs()) {

    int flow = INT_MAX;

    for (int u = n; u != 1; u = par[u]) flow = min(flow, cap[par[u]][u]);
    for (int u = n; u != 1; u = par[u]) cap[par[u]][u] -= flow, cap[u][par[u]] += flow;

    total_flow += flow;
  }

  cout << total_flow << endl;
  
}

int main() {

  #ifdef LOCAL
  freopen("file.in", "r", stdin);
  #else
  freopen("flux.in", "r", stdin);
  freopen("flux.out", "w", stdout);
  #endif

  ios_base::sync_with_stdio(false), cin.tie(NULL);
  
  solve();
}