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.*;
import java.io.*;
public class Main { //atcoder ABC128E -
	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(br.readLine());
		int n = Integer.parseInt(st.nextToken());
		int q = Integer.parseInt(st.nextToken());
		Rw[] rws = new Rw[n];
		for(int i = 0; i < n; i++){
			st = new StringTokenizer(br.readLine());
			int s = Integer.parseInt(st.nextToken());
			int t = Integer.parseInt(st.nextToken());
			int x = Integer.parseInt(st.nextToken());
			rws[i] = new Rw(s, t, x);
		}
		Arrays.sort(rws);
		TreeSet<Ped> set = new TreeSet<>();
		for(int i = 0; i < q; i++) {
			set.add(new Ped(Integer.parseInt(br.readLine()), i));
		}
		int[] dead = new int[q]; Arrays.fill(dead, -1);
		for(Rw r: rws){
			Ped comp = new Ped(r.s - r.x, 0);
			Ped p = set.ceiling(comp);
			while(p != null){
				if(p.d < r.t - r.x){
					set.remove(p);
					dead[p.ind] = r.x;
					p = set.ceiling(comp);
				}
				else break;
			}
		}
		for(int i = 0; i < q; i++){
			System.out.println(dead[i]);
		}
	}
	static class Rw implements Comparable<Rw>{
		int s, t, x;
		public Rw(int s, int t, int x){
			this.s = s; this.t = t; this.x = x;
		}
		@Override
		public int compareTo(Rw r){
			return x - r.x;
		}
		public String toString(){
			return s+"-"+t+","+x;
		}
	}
	static class Ped implements Comparable<Ped>{
		int d, ind;
		public Ped(int d, int ind){
			this.d = d; this.ind = ind;
		}
		@Override
		public int compareTo(Ped p){
			return d - p.d;
		}
		public String toString(){
			return ind+":"+d;
		}
	}
}
