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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Comparator;
import java.util.PriorityQueue;

public class Main {
  public static void main(String[] args) throws IOException {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

    String[] l = br.readLine().split(" ");
    int N = Integer.parseInt(l[0]);
    int Q = Integer.parseInt(l[1]);
    Point[] a = new Point[N * 2 + Q];
    for (int i = 0; i < N; i++) {
      String[] line = br.readLine().split(" ");
      int s = Integer.parseInt(line[0]);
      int t = Integer.parseInt(line[1]);
      int x = Integer.parseInt(line[2]);
      a[i * 2] = new End(s - x, i, x, true);
      a[i * 2 + 1] = new End(t - x, i, x, false);
    }
    for (int i = 0; i < Q; i++) {
      int d = Integer.parseInt(br.readLine());
      a[N * 2 + i] = new Query(d, i);
    }
    Arrays.sort(a, Comparator.comparingInt(point -> point.x));

    int[] result = new int[Q];
    Arrays.fill(result, -1);

    PriorityQueue<End> pq = new PriorityQueue<>(Comparator.comparingInt(end -> end.xx));
    boolean[] removed = new boolean[N];
    for (int i = 0; i < N * 2 + Q; i++) {
      Point p = a[i];
      if (p instanceof End) {
        End e = (End) p;
        if (e.start) pq.add(e);
        else removed[e.id] = true;
      } else {
        Query q = (Query) p;
        while (!pq.isEmpty() && removed[pq.peek().id]) {
          pq.poll();
        }
        if (!pq.isEmpty()) result[q.id] = pq.peek().xx;
      }
    }

    StringBuilder sb = new StringBuilder();
    for (int i = 0; i < Q; i++) {
      sb.append(result[i]).append('\n');
    }
    System.out.print(sb.toString());
  }

  private static class Point {
    protected final int x;

    private Point(int x) {
      this.x = x;
    }
  }

  private static class End extends Point {
    private final int id;
    private final int xx;
    private final boolean start;

    private End(int x, int id, int xx, boolean start) {
      super(x);
      this.id = id;
      this.xx = xx;
      this.start = start;
    }
  }

  private static class Query extends Point {
    private final int id;
    private Query(int x, int id) {
      super(x);
      this.id = id;
    }
  }
}
