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

using namespace std;
ifstream in("maxflow.in");
ofstream out("maxflow.out");

#define ll long long
#define pb push_back
const int inf = 1e9 + 5;
const int NMax = 1e3 + 5;

int N,M;
int cap[NMax][NMax],dad[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);
        if (!cap[x][y]) {
            v[y].pb(x);
        }

        cap[x][y] = c;
    }

    int mxFlow = 0;
    while (bfs()) {
        for (int pre : v[N]) {
            if (!dad[pre] || !cap[pre][N]) {
                continue;
            }

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

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

            mxFlow += mn;
        }
    }

    out<<mxFlow<<'\n';

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

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

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

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

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

            dad[nxt] = node;
            Q.push(nxt);
        }
    }

    return reachedN;
}