#include <iostream>
#include <queue>
#include <vector>
#include <fstream>
using namespace std;
const int NMAX =1e3;
int n, m;

int capacitate[NMAX+1][NMAX+1], flux[NMAX+1][NMAX+1];
int vis[NMAX+1], p[NMAX+1];

vector<int> G[NMAX+1];

int bfs(int s, int d) {
    for (int i=1; i<=n; i++) {
        vis[i] = 0;
        p[i]=0;
    }
    queue<int> q;
    q.push(s);
    vis[s] = 1;
    while (!q.empty()) {
        int nod = q.front();
        q.pop();
        for (auto vecin : G[nod]) {
            if (!vis[vecin] &&capacitate[nod][vecin] - flux[nod][vecin]>0) {
                vis[vecin] = 1;
                q.push(vecin);
                p[vecin] = nod;
            }
        }
    }
    if (!vis[d])
        return 0;
    vector<int> path;
    while (d!=0) {
        path.push_back(d);
        d = p[d];
    }
    reverse(path.begin(), path.end());
    int flow = 1e9;
    for (int i=1; i<path.size() - 1; i++) {
        int u = path[i];
        int v = path[i+1];
        flow = min(flow, capacitate[u][v] - flux[u][v]);
    }
    for (int i=1; i<path.size()-1; i++) {
        int u = path[i];
        int v = path[i+1];
        flux[u][v] += flow;
        flux[v][u] -= flow;
    }
    return flow;
}
int main() {
    ifstream cin("maxflow.in");
    ofstream cout("maxflow.out");
    cin >> n >> m ;
    for (int i=1; i<=m; i++) {
        int u,v, c;
        cin >> u >> v >> c;
         capacitate[u][v] = c;
        G[u].push_back(v);
        G[v].push_back(u);
        // avand stanga 1..n n+1..n+m, ducem toate arcele intr un nod s
    }
    int maxFlow = 0;
    while (true) {
        int flow = bfs(1, n);
        if (flow == 0) {
            break;
        }
        maxFlow += flow;
    }
}