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.util.*;
public class Main {

	static class event{
		int t, v, x;
		event(int t, int v, int x){
			this.t = t;
			this.v = v;
			this.x = x;
		}
	}
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int Q = sc.nextInt();
		event[] e = new event[N*2];
		for(int i = 0; i < N; i++) {
			int S = sc.nextInt();
			int T = sc.nextInt();
			int X = sc.nextInt();
			e[i] = new event(S - X, 1, X);
			e[N*2-1-i] = new event(T - X, -1, X);
		}
		Arrays.sort(e, (x, y) -> x.t != y.t ? x.t - y.t : x.v - y.v);
		TreeSet<Integer> b = new TreeSet<>();
		int i = 0;
		StringBuilder ans = new StringBuilder();
		for(int q = 0; q < Q; q++) {
			int D = sc.nextInt();
			while(true) {
				if(i >= N*2 || e[i].t > D)
					break;
				if(e[i].v == 1)
					b.add(e[i].x);
				else
					b.remove(e[i].x);
				i++;
			}
			ans.append(b.size() == 0 ? -1 + "\n" : b.first() + "\n");
		}
		System.out.println(ans);
	}

}