#include <fstream>
#include <vector>
#include <queue>
using namespace std;

const int inf=1<<30;

int bfs(const vector<vector<int > >&adj,vector<vector<int> >&cap,vector<int>&tav,int n,int start,int fin)
{
    fill(tav.begin(),tav.end(),-1);
    queue<int>q;
    q.push(start);
    tav[start]=-2;
    while(!q.empty()){
        int v=q.front();
        q.pop();
        for(int sz:adj[v])
        {
            if(tav[sz]==-1 && cap[v][sz])
            {
                tav[sz]=v;
                q.push(sz);
            }
        }
    }
    return tav[fin];
}

int maxflow(vector<vector<int> >&adj,vector<vector<int> >&cap,int n,int start,int fin)
{
    int t_flow=0;
    vector<int>tav(n+1,-1);
    int new_flow;
    while(bfs(adj,cap,tav,n,start,fin)!=-1)
    {
        for(auto v:adj[fin]){
            new_flow=cap[v][fin];
            for(int i=v;i!=0;i=tav[i])
                new_flow=min(new_flow,cap[tav[i]][i]);
            for(int i=v;i!=0;i=tav[i]){
                cap[tav[i]][i] -= new_flow;
				cap[i][tav[i]] += new_flow;
            }
            t_flow += new_flow;
			cap[v][fin] -= new_flow;
			cap[fin][v] += new_flow;
        }

    }
    return t_flow;
}


int main()
{
    ifstream be("maxflow.in");
    ofstream ki("maxflow.out");
    int n,m;
    be>>n>>m;
    vector<vector<int>>adj(n+1,vector<int>(n+1));
    vector<vector<int> >cap(n+1,vector<int>(n+1,0));
    for(int i=0;i<m;i++)
    {
        int x,y,c;
        be>>x>>y>>c;
        x--;
        y--;
        adj[x].push_back(y);
        adj[y].push_back(x);
        cap[x].push_back(y);
        cap[x][y]=c;

    }


    ki<<maxflow(adj,cap,n,0,n-1);

    return 0;
}