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 printArray(int[] a) {
		for (int i = 0; i < a.length; i++) {
			System.out.print(a[i] + ", ");
		}
		System.out.println();
	}

	public static<T> void printArrayT(T[] a) {
		for (int i = 0; i < a.length; i++) {
			System.out.print(a[i] + ", ");
		}
		System.out.println();
	}

	public static class Triple implements Comparable<Triple> {
		public int S, T, X;
		Triple(int S, int T, int X) {
			this.S = S;
			this.T = T;
			this.X = X;
		}

		@Override
		public String toString() {
			return String.format("(%d, %d, %d)", S, T, X);
		}

		@Override
		public int compareTo(Triple o) {
			return this.X - o.X;
		}
	}

	public static class Pair implements Comparable<Pair> {
		public int D, index;
		Pair(int D, int index) {
			this.D = D;
			this.index = index;
		}

		@Override
		public String toString() {
			return String.format("(%d, %d)", D, index);
		}

		@Override
		public int compareTo(Pair o) {
			return this.D - o.D;
		}
	}

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt(); // 2 * 10^5
		int Q = sc.nextInt(); // 2 * 10^5
		Triple[] STX = new Triple[N];
		TreeSet<Pair> DSET = new TreeSet<Pair>();
		int[] D = new int[Q];
		for (int i = 0; i < N; i++) {
			int s = sc.nextInt(); // 10^9
			int t = sc.nextInt(); // 10^9
			int x = sc.nextInt(); // 10^9
			STX[i] = new Triple(s, t, x);
		}
		for (int i = 0; i < Q; i++) {
			int d = sc.nextInt(); // 10^9
			DSET.add(new Pair(d, i));
			D[i] = -1;
		}

		Arrays.sort(STX, 0, N);
		for (Triple stx : STX) {
			int startTime = stx.S - stx.X;
			int endTime = stx.T - stx.X;
			Iterator<Pair> it = DSET.subSet(new Pair(startTime, -1), new Pair(endTime, -1)).iterator();
			while (it.hasNext()) {
				Pair pair = it.next();
				D[pair.index] = stx.X;
				it.remove();
			}
		}
		StringBuilder sb = new StringBuilder();
		for (int len : D) {
			sb.append(len);
			sb.append("\n");
		}
		System.out.print(sb);
	}
}
