#include <bits/stdc++.h>
using namespace std;
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");
int n,m, graf[1001][1001],a,b,c,rgraf[1001][1001];
bool bfs(int rgraf[1001][1001], int tata[], int n)
{
    bool vizitat[n+1];
    for(int i=1;i<=n;i++)
        vizitat[i] = false;

    queue<int> q;
    q.push(1);
    vizitat[1] = true;
    tata[1] = -1;

    while(!q.empty())
    {
        int u = q.front();
        q.pop();

        for(int i = 1; i<=n;i++)
        {
            if(vizitat[i] == false && rgraf[u][i] > 0)
            {
                tata[i] = u;
                if(i == n)
                {
                    return true;
                }

                q.push(i);
                vizitat[i] = true;
            }
        }
    }

    return false;

}
int main() {
    fin>>n>>m;
    for(int i=0;i<m;i++)
    {
        fin>>a>>b>>c;
        graf[a][b] = c;
    }

    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
        {
            rgraf[i][j] = graf[i][j];
        }

    int tata[n+1], max_flow = 0;

    while(bfs(rgraf, tata, n))
    {
        int capacitate_drum = INT_MAX;

        for(int i=n; i!=1; i = tata[i])
        {
            int u = tata[i];
            capacitate_drum = min(capacitate_drum, rgraf[u][i]);
        }

        for(int i=n; i!=1; i = tata[i])
        {
            int u = tata[i];
            rgraf[u][i] -= capacitate_drum;
            rgraf[i][u] += capacitate_drum;
        }

        max_flow += capacitate_drum;
    }

    cout<<max_flow;
    return 0;
}