/* 4. Ciclu eulerian cu un nod fals pentru a distinge ciclurile euleriene disjuncte
  (nu merge infoarena asa ca link catre submisia veche) : https://www.infoarena.ro/job_detail/2528389?action=view-source
 */
#include <fstream>
#include <vector>
#include <iostream>
#include <bitset>
#include <queue>
using namespace std;

const int N = 1001;

bitset <N> vis;
int capacity[N][N], from[N], n, start, finish, maxflow;
vector <int> L[N];

bool BFS()
{
    queue<int> q;
    vis.reset();
    for (int i = 1; i <= n; i++)
    {
        q.push(start);
        vis[start] = 1;
        while (!q.empty())
        {
            int curr = q.front();
            q.pop();
            for (int& next : L[curr])
                if (capacity[curr][next] != 0 && !vis[next])
                {
                    from[next] = curr;
                    if (next == finish)
                        return true;
                    vis[next] = true;
                    q.push(next);
                }
        }
    }
    return false;
}

void MaxFlow()
{
    while(BFS())
    {
        int curr = finish, flow = 2e9;
        while (curr != start)
        {
            int prev = from[curr];
            flow = min(flow, capacity[prev][curr]);
            curr = prev;
        }
        curr = finish;
        while (curr != start)
        {
            int prev = from[curr];
            capacity[prev][curr] -= flow;
            capacity[curr][prev] += flow;
            curr = prev;
        }
        maxflow += flow;
    }
    ofstream fout ("maxflow.out");
    fout << maxflow << "\n";
    fout.close();
}

void Read()
{
    int m;
    ifstream fin ("maxflow.in");
    fin >> n >> m;
    start = 1, finish = n;
    from[start] = -1;
    while (m--)
    {
        int x, y, c;
        fin >> x >> y >> c;
        L[x].push_back(y);
        capacity[x][y] = c;
    }
    fin.close();
}

int main()
{
    Read();
    MaxFlow();
    return 0;
}