#include<iostream>//Edmonds-karp, time complexity:O(V*E*E)
#include<queue>
using namespace std;
int INF;
int main()
{
memset(&INF,127,4);
const int max=202;
int flow[max][max];
int a[max];
int parents[max];
int capacity[max][max];
int f;
int n,m;
int i;
int s;
int t;
while(scanf("%d %d",&n,&m)!=EOF)
{
int from,to,cost;
memset(capacity,0,sizeof(capacity));
for(i=1;i<=n;i++)
{
scanf("%d %d %d",&from,&to,&cost);
capacity[from][to]+=cost;
}
s=1;
t=m;
f=0;
queue<int> qu;
memset(flow,0,sizeof(flow));
while(1)
{
memset(a,0,sizeof(a));
a[s]=INF;
qu.push(s);
while(!qu.empty())
{
int u=qu.front();
qu.pop();
for(int v=1;v<=m;v++)
if(a[v]==0&&capacity[u][v]>flow[u][v])
{
parents[v]=u;
qu.push(v);
if(a[u]<capacity[u][v]-flow[u][v])
{
a[v]=a[u];
}
else
{
a[v]=capacity[u][v]-flow[u][v];
}
}
/* for(int k=1;k<=m;k++)
{
cout<<a[k]<<endl;
}//跟综可改进流
cout<<endl;*/
}
if(a[t]==0)
break;
for(int u=t;u!=s;u=parents[u])
{
flow[parents[u]][u]+=a[t];
flow[u][parents[u]]-=a[t];
}
/* for(i=1;i<=m;i++)
{
for(int j=1;j<=m;j++)
{
cout<<"flow["<<i<<"]"<<"["<<j<<"]:"<<flow[i][j]<<" ";
}
cout<<endl;
}//跟综当前的流
cout<<"yes"<<endl;//标记一趟循环*/
f+=a[t];
}
printf("%d/n",f);
}
return 0;
}