#include<vector>
#include<iostream>
#include<queue>
#include<climits>
using namespace std;
static const int INF = INT_MAX / 3;
struct edge{
  int from,to,cap,rev;
};
struct ledge{
  int to,cap;
};
using node = int;
using graph = vector<vector<edge>>;
int dfs(int f,int v,int t,graph &g,vector<int> &level){
  if (v == t){
    return f;
  } 
  for(auto &e: g[v]){
    if(e.cap > 0 and
       level[e.to] > level[v]){
      int d = dfs(min(f,e.cap), e.to, t, g, level);
      if(d > 0){
        e.cap -= d;
        g[e.to][e.rev].cap += d;
        return d;
      }
    }
  }
  return 0;
}

int bfs(int s,int t,graph &g){
  using node = int;
  queue<node> q;
  vector<int> level(g.size(),-1);
  q.push(s);
  level[s] = 0;
  while(not q.empty()){
    auto v = q.front();q.pop();
    for(auto &e: g[v]){
      if(level[e.to] >= 0
         or e.cap <= 0) continue;
      q.push(e.to);
      level[e.to] = level[v] + 1;
    }
  }
  int d = 0,dd;
  while((dd = dfs(INF,s,t,g,level)) != 0){
    d += dd;
  }
  return d;
}

int max_flow(int s,int t,graph &g){
  int f = 0;
  while(true){
    int df = bfs(s,t,g);
    if (df == 0) break;
    f += df;
  }
  return f;
}

int main(){
  int v,e;
  cin >> v >> e;
  graph g(v);
  for(int i = 0; i < e;i++){
    int u,v,c;
    cin >> u >> v >> c;
    g[u].push_back({u,v,c,(int)g[v].size()});
    g[v].push_back({v,u,0,(int)g[u].size() - 1});
  }
  cout << max_flow(0,v-1,g) << endl;
}