A flow network is a directed graph which has a $source$ and a $sink$. In a flow network, each edge $(u, v)$ has a capacity $c(u, v)$. Each edge receives a flow, but the amount of flow on the edge can not exceed the corresponding capacity. Find the maximum flow from the $source$ to the $sink$.

Constraints

* $2 \leq |V| \leq 100$
* $1 \leq |E| \leq 1000$
* $0 \leq c_i \leq 10000$

Input

A flow network is given in the following format.

$|V|\;|E|$
$u_0\;v_0\;c_0$
$u_1\;v_1\;c_1$
:
$u_{|E|-1}\;v_{|E|-1}\;c_{|E|-1}$



$|V|$, $|E|$ is the number of vertices and edges of the flow network respectively. The vertices in $G$ are named with the numbers 0, 1,..., $|V|-1$. The source is 0 and the sink is $|V|-1$.

$u_i$, $v_i$, $c_i$ represent $i$-th edge of the flow network. A pair of $u_i$ and $v_i$ denotes that there is an edge from $u_i$ to $v_i$ and $c_i$ is the capacity of $i$-th edge.

Output

Print the maximum flow.

Example

Input

4 5
0 1 2
0 2 1
1 2 1
1 3 1
2 3 2


Output

3

import java.util.ArrayList;
import java.util.Scanner;

import static java.lang.Math.min;

/**
 * Created by shoya on 2017/04/13.
 */
public class Main {
    public static void main(String... args){
        Scanner sc = new Scanner(System.in);
        int V = sc.nextInt();
        int E = sc.nextInt();
        FordFulkersonClass ff = new FordFulkersonClass(V, E);

        for (int i = 0; i < E; i++){
            int s = sc.nextInt();
            int d = sc.nextInt();
            int c = sc.nextInt();
            ff.addEdge(s, d, c);
        }

        System.out.println(ff.fordFulkerson(0, V - 1));
        return;
    }


    public static class FordFulkersonClass {
        private class edge {
            int to; int cap; int rev;
            edge(int t, int c, int r){
                to = t; cap = c; rev = r;
            }
        }

        private int V, E;
        private boolean[] used;
        private ArrayList<ArrayList<edge>> edgeOfNodes;

        FordFulkersonClass(int v, int e){
            V = v; E = e;
            edgeOfNodes = new ArrayList<ArrayList<edge>>();
            for (int i = 0; i < V; i++)
                edgeOfNodes.add(new ArrayList<edge>());
        }

        public void addEdge(int from, int to, int cap){
            edgeOfNodes.get(from)
                    .add(new edge(to, cap, edgeOfNodes.get(to).size()));
            edgeOfNodes.get(to)
                    .add(new edge(from, 0, edgeOfNodes.get(from).size() - 1));
        }

        private int dfs(int source, int dest, int flow){
            //System.out.printf("%d %d %d\n", source, dest, flow);
            if (source == dest)
                return flow;
            used[source] = true;
            for (edge e : edgeOfNodes.get(source)){
                if (!used[e.to] && e.cap > 0){
                    int d = dfs(e.to, dest, min(flow, e.cap));
                    if (d > 0){
                        e.cap -= d;
                        edgeOfNodes.get(e.to).get(e.rev).cap += d;
                        return d;
                    }
                }
            }
            return 0;
        }

        public int fordFulkerson(int source, int dest){
            final int INF = 1 << 30;
            int flow = 0;
            while (true){
                used = new boolean[V];
                int f = dfs(source, dest, INF);
                if (f == 0)
                    break;
                flow += f;
            }
            return flow;
        }

    }

}