using namespace std;

#include <set>
#include <map>
#include <list>
#include <deque>
#include <stack>
#include <queue>
#include <cmath>
#include <ctime>
#include <cctype>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <utility>
#include <iomanip>
#include <fstream>
#include <cstring>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>

#define oo (1<<30)
#define f first
#define s second
#define II inline
#define db double
#define ll long long
#define pb push_back
#define mp make_pair
#define Size(V) ((ll)(V.size()))
#define all(V) (V).begin() , (V).end()
#define CC(V) memset((V),0,sizeof((V)))
#define CP(A,B) memcpy((A),(B),sizeof((B)))
#define FOR(i,a,b) for(ll (i)=(a);(i)<=(b);++(i))
#define REP(i, N) for (ll (i)=0;(i)<(ll)(N);++(i))
#define FORit(it, x) for (__typeof((x).begin()) it = (x).begin(); it != (x).end(); ++it)
#define printll(x) printf("%lld",(x))
#define printsp() printf(" ")
#define newline() printf("\n")
#define readll(x) scanf("%lld",&(x))
#define debugll(x) fprintf(stderr,"%lld\n",(x))

#define IN "maxflow.in"
#define OUT "maxflow.out"
#define N_MAX (1<<10)

typedef vector<int> VI;
typedef pair<int,int> pi;
typedef pair<short int,short int> ps;
typedef vector<string> VS;
template<class T> string toString(T n) {ostringstream ost;ost<<n;ost.flush();return ost.str();}

int N,M,Src,Des;
int Dist[N_MAX],T[N_MAX],Cap[N_MAX][N_MAX];
queue<int> Que;
vector<VI> V;

II void init(int N)
{
    V.clear();
    V.resize(N + 10);
    CC(Cap);
}

II void add_edge(int x,int y,int cap)
{
    V[x].pb(y);
    Cap[x][y] = cap;
}

II bool BF(int Src,int Des)
{
    CC(T);
    Que.push(Src);

    for(int nod;!Que.empty();)
    {
        nod = Que.front();
        Que.pop();

        FORit(it,V[nod])
            if(Cap[nod][*it])
            {
                Que.push(*it);
                T[*it] = nod;
            }
    }

    return T[Des];
}

II ll MaxFlow(int Src,int Des)
{
    ll flow = 0;

    for(;BF(Src,Des);)
    {
        int rem = oo;

        for(int nod = Des; T[nod]; rem = min(rem, Cap[ T[nod] ][nod]), nod = T[nod]);
        for(int nod = Des; T[nod]; Cap[ T[nod] ][nod] -= rem, Cap[nod][ T[nod] ] += rem, nod = T[nod]);

        flow += rem;
    }

    return flow;
}

int main()
{
    freopen(IN,"r",stdin);
    freopen(OUT,"w",stdout);

    scanf("%d%d",&N,&M);
    Src = 1;
    Des = N;

    init(N);

    int x,y,c;
    FOR(i,1,M)
    {
        scanf("%d%d%d",&x,&y,&c);
        add_edge(x,y,c);
    }

    printf("%lld\n",MaxFlow(Src,Des) );

    return 0;
}