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.PrintWriter;

class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int Q = sc.nextInt();
		int[] S = new int[N];
		int[] T = new int[N];
		int[] X = new int[N];
		int[] D = new int[Q];
		PrintWriter out = new PrintWriter(System.out);
		Comparator<Event> comparator = new Comparator<Event>() {
            @Override
            public int compare(Event o1, Event o2) {
                return Integer.valueOf(o1.t).compareTo(Integer.valueOf(o2.t));
            }
        };
		List<Event> event = new LinkedList<Event>();
		for (int i=0;i<N;i++) {
			S[i]=Integer.parseInt(sc.next());
			T[i]=Integer.parseInt(sc.next());
			X[i]=Integer.parseInt(sc.next());
			event.add(new Event(S[i]-X[i],1,X[i]));
			event.add(new Event(T[i]-X[i],-1,X[i]));
		}
		for (int i=0;i<Q;i++) {
			D[i]=Integer.parseInt(sc.next());
		}
		Collections.sort(event,comparator);
		TreeSet<Integer> set = new TreeSet<Integer>();
		int time=0;
		int w=0;
		loop:while (!event.isEmpty()) {
			Event tmp = event.remove(0);
			time=tmp.t;
			while (D[w]<time) {
				if (set.isEmpty()) {
					out.println(-1);
				} else {
					out.println(set.first());
				}
				w++;
				if (w==Q) {
					break loop;
				}
			}
			if (tmp.flag==1) {
				set.add(tmp.x);
			} else {
				set.remove(tmp.x);
			}
		}
		for (int i=w;i<Q;i++) {
			out.println(-1);
		}
		out.flush();
	}
}

class Event {
	int t;
	int flag;
	int x;
	Event(int t,int flag,int x) {
		this.t=t;
		this.flag=flag;
		this.x=x;
	}
}