#include <bits/stdc++.h>

using namespace std;

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

#define cin fin 
#define cout fout

vector<int> g[1001];
int c[1001][1001];
int flow[1001][1001];
int parent[1001];
int n, m;
bool v[1001];

bool bfs() {
    queue<int> q;
    q.push(1);
    memset(v,0,sizeof(v));
    v[1]=true;
    while(!q.empty()) {
        int node = q.front();
        q.pop();
        if (node==n) continue;
        for(auto i : g[node]) {
            if (flow[node][i]==c[node][i] || v[i]) continue;
            v[i]=true;
            q.push(i);
            parent[i]=node;
        }
    }
    return v[n];
}

int main()
{
    cin >> n >> m;
    for(int i = 1; i <= m; i++) {
        int x, y, cap;
        cin >> x >> y >> cap;
        c[x][y]+=cap;
        g[x].push_back(y);
        g[y].push_back(x);
    }
    int ans=0;
    for(ans = 0; bfs(); ) {
        for(auto node : g[n]) {
            if (flow[node][n]==c[node][n] || !v[node]) continue;
            parent[n]=node;
            int flowmin=INT_MAX;
            for(node=n; node != 1; node=parent[node]) {
                flowmin = min(flowmin, c[parent[node]][node]-flow[parent[node]][node]);
            }
            if (flowmin==0) continue;
            for(node=n; node != 1; node=parent[node]) {
                flow[parent[node]][node] += flowmin;
                flow[node][parent[node]] -= flowmin;
            }
            ans += flowmin;
        }
    }
    cout << ans;
    return 0;
}