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.io.IOException;
import java.io.InputStream;
import java.util.*;

public class Main {
	public static void main(String[] args) {
		FastScanner sc = new FastScanner();
		int V = sc.nextInt();
		int E = sc.nextInt();
		int[] u = new int[E];
		int[] v = new int[E];
		int[] c = new int[E];
		for (int i = 0; i < E; i++) {
			u[i] = sc.nextInt();
			v[i] = sc.nextInt();
			c[i] = sc.nextInt();
		}
		new FordFulkerson(V, E, u, v, c).ans();
	}


}

class FordFulkerson {
	static class Edge {
		int from;
		int to;
		Edge(int from, int to) {
			this.from = from;
			this.to = to;
		}
	}
	static final int INF = Integer.MAX_VALUE;
	int v;
	int e;
	TreeMap<Integer, ArrayList<Edge>> map;
	HashMap<Edge, Integer> edges;
	public FordFulkerson(int V, int e, int[] u, int[] v, int[] c) {
		this.v = V;
		this.e = e;
		map = new TreeMap<>();
		edges = new HashMap<>();
		for (int i = 0; i < this.v; i++) {
			map.put(i, new ArrayList<>());
		}
		for (int i = 0; i < e; i++) {
			Edge tmp = new Edge(u[i], v[i]);
			map.get(u[i]).add(tmp);
			edges.put(tmp, c[i]);
		}
	}
	void ans() {
		int maxflow = 0;
		while (true) {
			boolean[] used = new boolean[v];
			int f = dfs(0, INF, used);
			if (f == 0) {
				break;
			} else {
				maxflow += f;
			}
		}
		System.out.println(maxflow);
	}
	int dfs(int from, int flow, boolean[] used) {
		if (from == v - 1) {
			return flow;
		}
		used[from] = true;
		for (Edge edge: map.get(from)) {
			if (!used[edge.to] && edges.get(edge) > 0) {
				int d = dfs(edge.to, Math.min(flow, edges.get(edge)), used);
				if (d > 0) {
					edges.put(edge, edges.get(edge) - d);
					Edge rev = new Edge(edge.to, edge.from);
					if (edges.containsKey(rev)) {
						edges.put(rev, edges.get(rev) + d);
					} else {
						edges.put(rev, d);
					}
					map.get(edge.to).add(rev);
					return d;
				}
			}
		}
		return 0;
	}
}



class FastScanner {
	private final InputStream in = System.in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;
	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		} else {
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen <= 0) {
				return false;
			}
		}
		return true;
	}
	private int readByte() {
		if (hasNextByte()) {
			return buffer[ptr++];
		} else {
			return -1;
		}
	}
	private static boolean isPrintableChar(int c) {
		return 33 <= c && c <= 126;
	}
	public boolean hasNext() {
		while (hasNextByte() && !isPrintableChar(buffer[ptr])) {
			ptr++;
		}
		return hasNextByte();
	}
	public String next() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while (isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public long nextLong() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while (true) {
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			} else if (b == -1 || !isPrintableChar(b)) {
				return minus ? -n : n;
			} else {
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}
	public int nextInt() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || Integer.MAX_VALUE < nl) {
			throw new NumberFormatException();
		}
		return (int) nl;
	}
	public double nextDouble() {
		return Double.parseDouble(next());
	}
}
