#include <bits/stdc++.h>
#define N 1005
#define INF 0x3f3f3f3f
using namespace std;
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");
struct muchie
{
    int x,y,c;
};
int n,m,s,t;
int level[N],last[N];
vector<int>g[N];
bitset<N> viz;
queue<int>q;
vector<muchie>edges;
bool bfs()
{
    viz.reset();
    level[s]=0;
    viz[s]=1;
    q.push(s);
    while(!q.empty())
    {
        int x=q.front();
        q.pop();
        for(auto i:g[x])
            if(!viz[edges[i].y] && edges[i].c)
            {
                viz[edges[i].y]=1;
                level[edges[i].y]=level[x]+1;
                q.push(edges[i].y);
            }
    }
    return viz[t];
}
int dfs(int x,int flow)
{
    if(!flow) return 0;
    if(x==t) return flow;
    for(int &poz=last[x];poz<g[x].size();++poz)
    {
        int i=g[x][poz];
        int y=edges[i].y;
        int c=edges[i].c;
        if(level[y]!=level[x]+1 || !c) continue;
        int minFlow=dfs(y,min(flow,c));
        if(!minFlow) continue;
        edges[i].c-=minFlow;
        edges[i^1].c+=minFlow;
        return minFlow;
    }
    return 0;
}

int maxFlow()
{
    int flow = 0;
    while (bfs())
    {
        memset(last,0,sizeof(last));
        while (int newFlow = dfs(s,INF)) flow += newFlow;
    }
    return flow;
  }


int main()
{
    int i,x,y,c;
    fin>>n>>m;
    s=1;t=n;
    for(i=0;i<m;i++)
        fin>>x>>y>>c,
        g[x].push_back(2*i),
        edges.push_back({x,y,c}),
        g[y].push_back(2*i+1),
        edges.push_back({y,x,0});
    fout<<maxFlow();
    return 0;
}