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

#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
using namespace std;
ifstream in("maxflow.in");
ofstream out("maxflow.out");

const int NMax = 1e3 + 5;
const int inf = 1e9 + 5;
using zint = short;

int N,M;
int cap[NMax][NMax],prv[NMax];
bool vis[NMax];
vector<int> v[NMax];

bool bfs();

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

        v[x].pb(y);
        cap[x][y] = c;
        if (!cap[y][x]) {
            v[y].pb(x);
        }
    }

    ll ans = 0;
    while (bfs()) {
        for (int nxt : v[N]) {
            if (!vis[nxt] || !cap[nxt][N]) {
                continue;
            }

            prv[N] = nxt;
            int node = N, mn = inf;
            while (node != 1) {
                mn = min(mn, cap[prv[node]][node] );
                node = prv[node];
            }

            node = N;
            while (node != 1) {
                cap[prv[node]][node] -= mn;
                cap[node][prv[node]] += mn;
                node = prv[node];
            }

            ans += mn;
        }
    }

    out<<ans<<'\n';

    in.close();out.close();
    return 0;
}

bool bfs() {
    for (int i=1;i <= N;++i) {
        vis[i] = false;
    }

    queue<int> Q;
    Q.push(1);
    bool reachedN = false;
    while (Q.size()) {
        int node = Q.front();
        Q.pop();

        if (node == N) {
            reachedN = true;
            continue;
        }

        for (int nxt : v[node]) {
            if (vis[nxt] || !cap[node][nxt]) {
                continue;
            }

            vis[nxt] = true;
            prv[nxt] = node;
            Q.push(nxt);
        }
    }

    return reachedN;
}