#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <iterator>
#include <random>
#include <assert.h>
using namespace std;

const string file = "maxflow";

const string infile = file + ".in";
const string outfile = file + ".out";

const int INF = 0x3f3f3f3f; 

//#define ONLINE_JUDGE

int MaxFlow = 0;
vector<vector<int> > Cap;
vector<vector<int> > G;

vector<int> prec;
int S, D;

bool bfs(int S, int D)
{
    fill(prec.begin(), prec.end() , -1);
    queue<int> que;
    que.push(S);

    while(que.empty() == false)
    {
        int x = que.front();
        que.pop();

        if(x == D)
            return true;
        for(vector<int>::iterator itr = G[x].begin();
                itr != G[x].end();
                itr++)
        {
            if(Cap[x][*itr] == 0)
                continue;
            if(prec[*itr] != -1)
                continue;

            prec[*itr] = x;
            que.push(*itr);
        }
    }
    return false;
}

int main()
{
#ifdef ONLINE_JUDGE
	ostream &fout = cout;
	istream &fin = cin;
#else
	fstream fin(infile.c_str(), ios::in);
	fstream fout(outfile.c_str(), ios::out);
#endif	

    int N, M;
    fin >> N >> M;
    Cap.resize(N + 1, vector<int>(N + 1, 0));
    prec.resize(N + 1);
    G.resize(N + 1);

    S = 1;
    D = N;

    for(int i = 0; i < M; i++)
    {
        int x, y, c;
        fin >> x >> y >> c;
        Cap[x][y] = c;
        G[x].push_back(y);
        G[y].push_back(x);
    }

    while(bfs(S, D))
    {
        for(vector<int>::iterator itr = G[D].begin();
                itr != G[N].end();
                itr++)
        {
            if(prec[*itr] == -1 || Cap[*itr][D] == 0)
                continue;

            prec[N] = *itr;

            
            int minFlow = INF;
            for(int i = D; i != S; i = prec[i])
            {
                minFlow = min(minFlow, Cap[prec[i]][i]);
            }
            
            for(int i = D; i != S; i = prec[i])
            {
                Cap[prec[i]][i] -= minFlow;
                Cap[i][prec[i]] += minFlow;
            }

            MaxFlow += minFlow;
        }
    }
    fout << MaxFlow << "\n";
#ifdef ONLINE_JUDGE
#else
    fout.close();
	fin.close();
#endif
}