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 printList(Iterable<T> a) {
		System.out.print("[");
		boolean first = true;
		for (T t : a) {
			if (first) {
				first = false;
			} else {
				System.out.print(", ");
			}
			System.out.print(t);
		}
		System.out.println("]");
	}

	public enum Event {
		Unblock, Block, Walk,
	}

	public static final class Item implements Comparable<Item> {
		public int time, X;
		public Event event;
		public Item(int time, Event event, int X) {
			this.time = time;
			this.event = event;
			this.X = X;
		}

		@Override
		public int compareTo(Item o) {
			int x = this.time - o.time;
			if (x != 0) {
				return x;
			}
			return this.event.compareTo(o.event);
		}

		@Override
		public String toString() {
			return String.format("(%d, %s, %d)", time, event, X);
		}
	}

	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

		ArrayList<Item> list = new ArrayList<>();
		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
			list.add(new Item(s - x, Event.Block, x));
			list.add(new Item(t - x, Event.Unblock, x));
		}
		for (int i = 0; i < Q; i++) {
			int d = sc.nextInt(); // 10^9
			list.add(new Item(d, Event.Walk, i));
		}
		Collections.sort(list);
		// printList(list);
		int[] answers = new int[Q];
		TreeSet<Integer> blocks = new TreeSet<Integer>();

		for (Item item : list) {
			if (item.event == Event.Block) {
				blocks.add(item.X);
			}
			if (item.event == Event.Unblock) {
				blocks.remove(item.X);
			}
			if (item.event == Event.Walk) {
				// printList(blocks);
				answers[item.X] = blocks.isEmpty() ? - 1 : blocks.first();
			}
		}
		StringBuilder sb = new StringBuilder();
		for (int x : answers) {
			sb.append(x);
			sb.append("\n");
		}
		System.out.print(sb);
	}
}
