There is an infinitely long street that runs west to east, which we consider as a number line.

There are N roadworks scheduled on this street. The i-th roadwork blocks the point at coordinate X_i from time S_i - 0.5 to time T_i - 0.5.

Q people are standing at coordinate 0. The i-th person will start the coordinate 0 at time D_i, continue to walk with speed 1 in the positive direction and stop walking when reaching a blocked point.

Find the distance each of the Q people will walk.

Constraints

* All values in input are integers.
* 1 \leq N, Q \leq 2 \times 10^5
* 0 \leq S_i < T_i \leq 10^9
* 1 \leq X_i \leq 10^9
* 0 \leq D_1 < D_2 < ... < D_Q \leq 10^9
* If i \neq j and X_i = X_j, the intervals [S_i, T_i) and [S_j, T_j) do not overlap.

Input

Input is given from Standard Input in the following format:


N Q
S_1 T_1 X_1
:
S_N T_N X_N
D_1
:
D_Q


Output

Print Q lines. The i-th line should contain the distance the i-th person will walk or -1 if that person walks forever.

Example

Input

4 6
1 3 2
7 13 10
18 20 13
3 4 2
0
1
2
3
5
8


Output

2
2
10
-1
13
-1
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.SortedMap;
import java.util.TreeMap;

public class Main {
	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String[] sa = br.readLine().split(" ");
		int n = Integer.parseInt(sa[0]);
		int q = Integer.parseInt(sa[1]);
		Kouji[] arr = new Kouji[n];
		for (int i = 0; i < n; i++) {
			sa = br.readLine().split(" ");
			Kouji o = new Kouji();
			o.s = Integer.parseInt(sa[0]);
			o.t = Integer.parseInt(sa[1]);
			o.x = Integer.parseInt(sa[2]);
			o.s = Math.max(o.s - o.x, 0);
			o.t = Math.max(o.t - o.x, 0);
			arr[i] = o;
		}
		TreeMap<Integer, Integer> map = new TreeMap<Integer, Integer>();
		for (int i = 0; i < q; i++) {
			map.put(Integer.parseInt(br.readLine()), i);
		}
		br.close();

		Arrays.parallelSort(arr);

		int[] ans = new int[q];
		Arrays.fill(ans, -1);

		for (int i = 0; i < n; i++) {
			Kouji o = arr[i];
			SortedMap<Integer, Integer> sm = map.subMap(o.s, o.t);
			Integer[] keys = sm.keySet().toArray(new Integer[0]);
			for (Integer k : keys) {
				ans[sm.get(k)] = o.x;
				map.remove(k);
			}
		}

		PrintWriter pw = new PrintWriter(System.out);
		for (int i = 0; i < q; i++) {
			pw.println(ans[i]);
		}
		pw.flush();
	}

	static class Kouji implements Comparable<Kouji> {
		int s, t, x;
		public String toString() {
			return "[" + s + "," + t + "," + x + "]";
		}

		public int compareTo(Kouji o) {
			return x - o.x;
		}
	}
}
