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 {
	public static void main(String[] args) {
		Main main = new Main();
		main.run();
	}

	class Ev implements Comparable<Ev>{
		int x;
		int time;
		int kind;

		public Ev(int x, int time, int kind) {
			this.x=x;
			this.time=time;
			this.kind=kind;
		}

		@Override
		public int compareTo(Ev arg0) {
			return this.time - arg0.time;
		}
	}

	public void run() {
		Scanner sc = new Scanner(System.in);
		int N=sc.nextInt();
		int Q=sc.nextInt();

		ArrayList<Ev> ev = new ArrayList<>();
		for(int i=0; i<N; i++) {
			int s=sc.nextInt();
			int t=sc.nextInt();
			int x=sc.nextInt();
			ev.add(new Ev(x, s-x, 1));
			ev.add(new Ev(x, t-x, -1));
		}

		Collections.sort(ev);

		ArrayList<Integer> D = new ArrayList<>();
		for(int i=0; i<Q; i++) {
			D.add(sc.nextInt());
		}

		TreeSet<Integer> set = new TreeSet<>();

		int ans[] = new int[Q];
		Arrays.fill(ans, -1);
		int didx = 0;

		for(Ev e : ev) {

			//アクティブイベントに対してDがぶつかるかテスト
			while(didx<D.size() && D.get(didx) < e.time) {
				if(set.isEmpty()) {
					ans[didx] = -1;
				}else {
					ans[didx] = set.first();
				}
				didx++;
			}


			//アクティブイベント更新
			if(e.kind==1) {
				set.add(e.x);
			} else {
				set.remove(e.x);
			}
		}

		StringBuilder sb = new StringBuilder();
		for(int i=0; i<Q; i++) {
			sb.append(ans[i]).append("\n");
		}
		System.out.println(sb.toString());
		sc.close();
	}
}
