#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>

const int MAXN = 1002 + 1;

using namespace std;

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

int flux[MAXN][MAXN],capacitate[MAXN][MAXN],pred[MAXN];
vector<int>graf[MAXN];
queue<int> coada;
int n,m;

int main()
{
    in>>n>>m;
    for(int i = 1; i <= m; i++){
        int x,y,cap;
        in>>x>>y>>cap;
        graf[x].emplace_back(y);
        graf[y].emplace_back(x);
        capacitate[x][y] = cap;
    }
    int ans = 0;
    while(true){
        for(int i = 1; i <= n; i++)
            pred[i] = 0;
        coada.push(1);
        while(coada.size()){
            int nod = coada.front();

            coada.pop();
            for(auto const &vecin : graf[nod]){
                if(!pred[vecin] && vecin != 1 && flux[nod][vecin] < capacitate[nod][vecin]){
                    pred[vecin] = nod;
                    coada.push(vecin);
                    if(vecin == n){
                        while(coada.size()){
                            coada.pop();
                        }
                        break;
                    }
                }
            }
        }
        if(pred[n] == 0)
            break;

        int minim = 2e9;
        int nod = n;

        while(pred[nod] != 0){
            int inapoi = pred[nod];
            minim = min(minim,capacitate[inapoi][nod] - flux[inapoi][nod]);
            nod = pred[nod];
        }
        nod = n;
        while(pred[nod] != 0){
            int inapoi = pred[nod];
            flux[inapoi][nod] += minim;
            flux[nod][inapoi] -= minim;
            nod = pred[nod];
        }
        ans += minim;
    }
    out<<ans<<"\n";
    return 0;
}