#include<iostream>
#include<cstdio>
#include<string.h>
#include<string>
#include<stack>
#include<set>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<sstream>
#include<queue>
#define ll __int64
#define lll unsigned long long
#define MAX 1000009
#define MAXN 2009
#define eps 1e-8
#define INF 0x7fffffff
#define mod 1000000007
#define clr(a) memset(a,0,sizeof(a))
#define clr1(a) memset(a,-1,sizeof(a))
#define lson l , m , rt << 1
#define rson m + 1 , r , rt << 1 | 1
using namespace std;
inline ll Max(ll a,ll b)
{
return a>b?a:b;
}
inline ll Min(ll a,ll b)
{
return a<b?a:b;
}
const int N = 500;
const int M = 50000;
struct Edge
{
int from,to,flow,cap;
};
struct Dinic
{
int n,m,s,t;
vector<Edge>edges;
vector<int>G[N];
bool vis[N];
int d[N];
int cur[N];
void addedge(int from,int to,int cap)
{
edges.push_back((Edge)
{
from,to,0,cap
});
edges.push_back((Edge)
{
to,from,0,0
});
m = edges.size();
G[from].push_back(m - 2);
G[to].push_back(m - 1);
}
bool BFS()
{
clr(vis);
queue<int>Q;
Q.push(s);
d[s] = 0;
vis[s] = 1;
while(!Q.empty())
{
int x = Q.front();
Q.pop();
for(int i = 0; i<G[x].size(); i++)
{
Edge& e = edges[G[x][i]];
if(!vis[e.to]&&e.cap>e.flow)
{
vis[e.to] = 1;
d[e.to] = d[x] + 1;
Q.push(e.to);
}
}
}
return vis[t];
}
int DFS(int x,int a)
{
if(x==t||a==0)return a;
int flow = 0,f;
for(int& i = cur[x]; i<G[x].size(); i++)
{
Edge& e = edges[G[x][i]];
if(d[x] + 1== d[e.to]&&(f = DFS(e.to , min(a, e.cap - e.flow)))>0)
{
e.flow+=f;
edges[G[x][i]^1].flow-=f;
flow+=f;
a-=f;
if(a==0)break;
}
}
return flow;
}
int MaxFlow(int s,int t)
{
this->s = s;
this->t = t;
int flow = 0;
while(BFS())
{
clr(cur);
flow+=DFS(s,INF);
}
return flow;
}
};
int main()
{
#ifdef ONLINE_JUDGE
#else
freopen("an.txt","r", stdin);
#endif
int m,n;
int u,v,w;
while(~scanf("%d%d",&m,&n))
{
Dinic x;
for(int i = 0;i<m;i++)
{
scanf("%d%d%d",&u,&v,&w);
x.addedge(u,v,w);
}
cout<<x.MaxFlow(1,n)<<endl;
}
return 0;
}
#include<cstdio>
#include<string.h>
#include<string>
#include<stack>
#include<set>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<sstream>
#include<queue>
#define ll __int64
#define lll unsigned long long
#define MAX 1000009
#define MAXN 2009
#define eps 1e-8
#define INF 0x7fffffff
#define mod 1000000007
#define clr(a) memset(a,0,sizeof(a))
#define clr1(a) memset(a,-1,sizeof(a))
#define lson l , m , rt << 1
#define rson m + 1 , r , rt << 1 | 1
using namespace std;
inline ll Max(ll a,ll b)
{
return a>b?a:b;
}
inline ll Min(ll a,ll b)
{
return a<b?a:b;
}
const int N = 500;
const int M = 50000;
struct Edge
{
int from,to,flow,cap;
};
struct Dinic
{
int n,m,s,t;
vector<Edge>edges;
vector<int>G[N];
bool vis[N];
int d[N];
int cur[N];
void addedge(int from,int to,int cap)
{
edges.push_back((Edge)
{
from,to,0,cap
});
edges.push_back((Edge)
{
to,from,0,0
});
m = edges.size();
G[from].push_back(m - 2);
G[to].push_back(m - 1);
}
bool BFS()
{
clr(vis);
queue<int>Q;
Q.push(s);
d[s] = 0;
vis[s] = 1;
while(!Q.empty())
{
int x = Q.front();
Q.pop();
for(int i = 0; i<G[x].size(); i++)
{
Edge& e = edges[G[x][i]];
if(!vis[e.to]&&e.cap>e.flow)
{
vis[e.to] = 1;
d[e.to] = d[x] + 1;
Q.push(e.to);
}
}
}
return vis[t];
}
int DFS(int x,int a)
{
if(x==t||a==0)return a;
int flow = 0,f;
for(int& i = cur[x]; i<G[x].size(); i++)
{
Edge& e = edges[G[x][i]];
if(d[x] + 1== d[e.to]&&(f = DFS(e.to , min(a, e.cap - e.flow)))>0)
{
e.flow+=f;
edges[G[x][i]^1].flow-=f;
flow+=f;
a-=f;
if(a==0)break;
}
}
return flow;
}
int MaxFlow(int s,int t)
{
this->s = s;
this->t = t;
int flow = 0;
while(BFS())
{
clr(cur);
flow+=DFS(s,INF);
}
return flow;
}
};
int main()
{
#ifdef ONLINE_JUDGE
#else
freopen("an.txt","r", stdin);
#endif
int m,n;
int u,v,w;
while(~scanf("%d%d",&m,&n))
{
Dinic x;
for(int i = 0;i<m;i++)
{
scanf("%d%d%d",&u,&v,&w);
x.addedge(u,v,w);
}
cout<<x.MaxFlow(1,n)<<endl;
}
return 0;
}