#include <bits/stdc++.h>
using namespace std;
ifstream f("maxflow.in");
ofstream g("maxflow.out");
class flux{
    int n,m,s,d,x,y,cost;
    vector<int> *v;
    vector< vector<int> > c;
    vector<int> t;
    queue<int> q;
public:
    flux(int n, int m, int s, int d);
    void addEdge(int x, int y, int cost);
    int bf();
    int flux_maxim();
};
flux::flux(int n, int m, int s, int d)
{
    this->n=n+1;
    this->m=m+1;
    this->s=s;
    this->d=d;
    v=new vector<int> [n+1];
    c.resize(n+1);
    for(int i=0;i<c.size();i++)
        c[i].resize(n+1);
}
int flux::bf()
{
    t.assign(n+1,0);
    t[1]=1;
    q.push(s);
    while(q.size())
    {
        int i=q.front();
        q.pop();
        for(auto j: v[i])
        {
            if(t[j]==0&&c[i][j]>0)
            {
                t[j]=i;
                if(j!=d) q.push(j);
            }
        }
    }
    if(t[d]) return 1;
    return 0;
}
int flux::flux_maxim()
{
    int fluxs=0;
    while(bf())
    {
        for(auto i: v[d])
        if(t[i])
        {
            t[d]=i;
            int minn=2000000000;
            i=d;
            while(i!=s)
            {
                minn=min(minn,c[t[i]][i]);
                i=t[i];
            }
            i=d;
            while(i!=s)
            {
                c[t[i]][i]-=minn;
                c[i][t[i]]+=minn;
                i=t[i];
            }
            fluxs+=minn;
        }
    }
    return fluxs;
}
void flux::addEdge(int x, int y, int cost)
{
    v[x].push_back(y);
    v[y].push_back(x);
    c[x][y]=cost;
}
int main()
{
    int n,m;
    f>>n>>m;
    flux grf(n,m,1,n);
    for(int i=1;i<=m;i++)
    {
        int x,y,ci;
        f>>x>>y>>ci;
        grf.addEdge(x,y,ci);
    }
    g<<grf.flux_maxim()<<'\n';
    return 0;
}