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.Scanner;
import java.util.ArrayList;
import java.util.TreeSet;
import java.util.Collections;
import java.io.PrintWriter;

public class Main {
  static int N;
  static int Q;
  static ArrayList<S> ss;
  static PrintWriter writer = new PrintWriter(System.out);
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    N = Integer.parseInt(sc.next());
    Q = Integer.parseInt(sc.next());
    ss = new ArrayList<S>();
    for (int i = 0; i < N; i++){
      int s = Integer.parseInt(sc.next());
      int t = Integer.parseInt(sc.next());
      int x = Integer.parseInt(sc.next());
      ss.add(new S(x,s-x,-1));
      ss.add(new S(x,t-x,-2));            
    }
    for (int i = 0; i < Q; i++) {
      int d = sc.nextInt();
      ss.add(new S(-1,d,i));
    }
    Collections.sort(ss);
    TreeSet<Integer> cons = new TreeSet<>();
    int[] ans = new int[Q];
    for (int i =0; i<ss.size(); i++) {
      S s = ss.get(i);
      if (s.index == -1) {
        cons.add(s.x);        
      } else if (s.index == -2) {
        cons.remove(s.x);        
      } else {
        ans[s.index] = cons.isEmpty() ? -1 : cons.first();
      }
    }
    for (int i = 0; i < Q; i++) {
      writer.println(ans[i]);
    }
    writer.flush();
  }
  public static class S implements Comparable<S> {
    int x;
    int t;
    int index;
    public S(int x, int t, int index) {
      this.x = x;
      this.t = t;
      this.index = index;
    }
    public int compareTo(S o){
      int dt = this.t- o.t;
      if (dt != 0) {
        return dt;
      } else {
        return this.index - o.index;
      }
    }
  }
}
