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

#define pb push_back
#define NN 1001

ofstream out("maxflow.out");

int fl[NN][NN],cap[NN][NN],n,m,ans,t[NN],uz[NN];

vector<int>G[NN];
typedef vector<int>:: iterator IT;
queue<int>Q;

void read();
bool BFS();
void solve();

int main()
{
	read();
	solve();
	out<<ans;
	return 0;
	
	
}


void read()
{
	ifstream in("maxflow.in");
	in>>n>>m;
	
	for(int x,y,c;m;--m)
	{
		in>>x>>y>>c;
		cap[x][y]=c;
		G[x].pb(y);
		G[y].pb(x);
	}
}


bool BFS()
{
	memset(uz,0,sizeof(uz));
	queue<int>Q;
	Q.push(1);
	uz[1]=1;
	int k;
	while(!Q.empty())
		{
			k=Q.front();
				if(k!=n)
					for(IT I=G[k].begin();I!=G[k].end();++I)
						if(!uz[*I] &&  fl[k][*I]<cap[k][*I])
							{
								uz[*I]=1;
								t[*I]=k;
								Q.push(*I);
								
							}
						Q.pop();
	}
	return uz[n];
}

void solve()
{
	int sol;
	while(BFS())
		{
			for(int i=1;i<n;i++)
				if(fl[i][n] < cap[i][n] )
					{	
						sol=cap[i][n]-fl[i][n];
							for(int j=i;j!=1;j=t[j])
									if(cap[t[j]][j]-fl[t[j]][j]<sol)
										sol=cap[t[j]][j]-fl[t[j]][j];
										fl[i][n]+=sol;
										fl[n][i]-=sol;
										for(int j=i;j!=1;j=t[j])
											{
												fl[t[j]][j]+=sol;
												fl[j][t[j]]-=sol;
											}
											ans+=sol;
									
					}
		}
}