#include <fstream>
#include <vector>
#include <deque>

using namespace std;

ifstream fin( "maxflow.in" );
ofstream fout( "maxflow.out" );

const int NMAX = 1005;
const int INF = 2000000000;

int N, M;

vector <int> Ad[NMAX];

int cap[NMAX][NMAX];
int flow[NMAX][NMAX];

int parent[NMAX];

void Read()
{
  fin >> N >> M;

  int x, y, c;
  for( int i = 1; i <= M; ++i )
  {
    fin >> x >> y >> c;

    Ad[x].push_back( y );

    cap[x][y] = c;
  }
}

bool Dfs()
{
  bool vis[NMAX] = { 0 };

  deque <int> Q;

  vis[1] = true;
  Q.push_back( 1 );

  int u, w;

  while( !Q.empty() )
  {
    u = Q.front();
    Q.pop_front();

    for( int i = 0; i < Ad[u].size(); ++i )
    {
      w = Ad[u][i];

      if( !vis[w] && cap[u][w] - flow[u][w] > 0 )
      {
        vis[w] = true;
        Q.push_back( w );

        parent[w] = u;

        if( w == N ) return true;
      }
    }
  }

  return false;
}

void Do()
{
  int flow_tot = 0;
  int flow_curent;

  while( Dfs() )
  {
    flow_curent = INF;

    for( int i = N; i != 1; i = parent[i] )
      flow_curent = min( flow_curent, cap[ parent[i] ][i] - flow[ parent[i]][i] );

    for( int i = N; i != 1; i = parent[i] )
    {
      flow[ parent[i] ][i] += flow_curent;
      flow[i][ parent[i] ] -= flow_curent;
    }

    flow_tot += flow_curent;
  }

  fout << flow_tot << '\n';
}

int main()
{
    Read();
    Do();

    return 0;
}