// Reads a capacitated, directed graph from a file and
// then uses Sedgewick's code for Ford-Fulkerson network flows

import java.util.Scanner;

public class netflowFile
{
  public static void main(String[] args)
  {
    Scanner sc=new Scanner(System.in);
    int v=sc.nextInt();
    int e=sc.nextInt();
    Network G1=new Network(v),G2=new Network(v);
    for (int i=0;i<e;i++)
    {
      int x=sc.nextInt(),y=sc.nextInt(),z=sc.nextInt();
      G1.insert(new Edge(x,y,z));
      G2.insert(new Edge(x,y,z));
    }
    NetworkMaxFlow nmf1=new NetworkMaxFlow(G1,0,v-1,false);
    NetworkMaxFlow nmf2=new NetworkMaxFlow(G2,0,v-1,true);
  }
}