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

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

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

int N,M;
int cap[NMax][NMax],dad[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;

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

    int mxFlow = 0;
    while (bfs()) {

        for (auto prev : v[N]) {
            if (!vis[prev] || !cap[prev][N]) {
                continue;
            }

            dad[N] = prev;
            int nod = N, mnFlow = inf;
            while (nod != 1) {
                mnFlow = min(mnFlow,cap[dad[nod]][nod]);
                nod = dad[nod];
            }

            if (!mnFlow) {
                continue;
            }

            nod = N;
            while (nod != 1) {
                cap[dad[nod]][nod] -= mnFlow;
                cap[nod][dad[nod]] += mnFlow;

                nod = dad[nod];
            }

            mxFlow += mnFlow;
        }
    }

    out<<mxFlow<<'\n';

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

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

    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 (auto nxt : v[node]) {
            if (vis[nxt] || !cap[node][nxt]) {
                continue;
            }

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

    return reachedN;
}