/*
ID: dbatyr02
PROG: ditch
LANG: C++11
*/
/**
	Template by Danel Batyrbek
	All rights reserved 2017 (lol)
*/


#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <cstdio>
#include <ctime>
#include <cstring>

using namespace std;

typedef long long ll;
typedef double ld;
typedef long double lld;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

const int N = 1e5 + 10;
const int N3 = 1e3 + 10;
const int INF = 2e9 + 10;
const int mod = 1e9 + 7;
const ll LINF = 4e18 + 10;

#define fr first
#define sc second
#define pb push_back
#define mkp make_pair
#define ins insert
#define all(x) x.begin(),x.end()
#define speed_up ios_base::sync_with_stdio(0);cin.tie(0)
#define debug(x) cerr << x << '\n'
#define fname "ditch"

int n, m, s, t, last[300], d[300];
vector <vector <ll> > c, f, g;
bool u[300];

/*struct edge {
	int x, to, f, c;
	edge () : x(), to(), f(), c() {}
	edge (int x, int to, int f, int c) x(x), to(to), f(f), c(c) {}
}*/

bool bfs(int x){
	for(int i = 1; i <= n; ++ i){
		d[i] = INF;
	}
	d[x] = 0;
	queue <int> q;
	q.push(x);
	while(q.size()){
		int v = q.front();
		q.pop();
		for(int i = 0; i < g[v].size(); ++ i){
			int to = g[v][i];
			if(f[v][to] < c[v][to] && d[to] == INF){
				q.push(to);
				d[to] = d[v] + 1;
			}
		}
	}
	return (d[t] != INF);
}

ll dfs(int x, ll minC){
	//cerr << x << '\n';
	if(x == t || minC == 0){
		return minC;
	}
	for(int i = last[x]; i < g[x].size(); ++ i){
		int to = g[x][i];
		//cerr << "TO: " << to << ", D[X]: " << d[x] << ", D[TO]: " << d[to] << '\n';
		if(d[to] == d[x] + 1){
			ll delta = dfs(to, min(minC, c[x][to] - f[x][to]));
			if(delta){
				f[x][to] += delta;
				f[to][x] -= delta;
				return delta;
			}
		}
		last[x] = i;
	}
	return 0;
}

ll mxFlow(){
	ll mx = 0;
	while(bfs(s)){
		//for(int i = 1; i <= n; ++ i){
		//	cerr << d[i] << ' ';
		//}
		//cerr << INF << '\n';
		memset(last, 0, sizeof last);
		memset(u, 0, sizeof u);
		ll flow = dfs(s, INF);
		while(flow != 0){
			mx += flow;
			flow = dfs(s, INF);
		}
	}
	return mx;
}

int main(){
#ifndef DEBUG
	freopen(fname".in", "r", stdin);
	freopen(fname".out", "w", stdout);
#endif
	cin >> m >> n;
	g.resize(n + 1);
	c.resize(n + 1);
	f.resize(n + 1);
	for(int i = 0; i <= n; ++ i){
		c[i].resize(n + 1);
		f[i].resize(n + 1);
	}
	for(int i = 1; i <= m; ++ i){
		int x, y, z;
		cin >> x >> y >> z;
		g[x].pb(y);
		g[y].pb(x);
		c[x][y] = z;
		//g[i] = edge(x, y, 0, c);
	}
	s = 1, t = n;
	cout << mxFlow() << '\n';
	return 0;
}