#include <iostream>

#include <algorithm>

#include <cstring>

#include <cstdio>

#include <queue>

using namespace std;

const int maxn =  + ;

int c[maxn][maxn]; //流量限制

int f[maxn][maxn]; //目前流量

int p[maxn];       //残余流量

int pre[maxn];     //路径记录

const int inf = 0x5fffffff;

int n,m;

queue<int>q;

int ek(int st,int ed)

{

   int flow = ;

   while()

    {

        memset(p,,sizeof(p));

        p[st] = inf,pre[st] = ;

        q.push(st);

        while(!q.empty())

         {

              int x = q.front();q.pop();

              for(int i =  ; i <= m ; ++ i)

               if (!p[i] && f[x][i] < c[x][i]) //允许增广

                {

                      q.push(i);

                      pre[i] = x; //路径记录

                  p[i] = min(c[x][i] - f[x][i] , p[x]);

               }

         }

        if (!p[ed]) // 增广路搜寻完毕，无可增加的流量

         break;

        int cur = ed;

        while(cur)

         {

             f[pre[cur]][cur] += p[ed];

             f[cur][pre[cur]] -= p[ed];

             cur = pre[cur];

         }

        flow += p[ed];

    }

   return flow;

}

int main(int argc,char *argv[])

{

  memset(c,,sizeof(c));

  memset(f,,sizeof(f));

  scanf("%d%d",&n,&m);

  while(n--)

   {

         int u,v,w;

         scanf("%d%d%d",&u,&v,&w);

         c[u][v] += w;

   }

  printf("%d\n",ek(,m));

  return ;

}