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.Arrays;
import java.io.*;

class Main {
    static final PrintWriter out = new PrintWriter(System.out);
    static final Scanner sc = new Scanner(System.in);
        
    static final SqrtDecomposition rmq = new SqrtDecomposition(200010);
    static int n, q;
    static final int[] s = new int[200005];
    static final int[] t = new int[200005];
    static final int[] x = new int[200005];
    static final int[] d = new int[200005];

    public static void main(String[] args) {

        n = sc.nextInt();
        q = sc.nextInt();
        for (int i = 0; i < n; i++) {
            s[i] = sc.nextInt();
            t[i] = sc.nextInt();
            x[i] = sc.nextInt();
        }
        for (int i = 0; i < q; i++) {
            d[i] = sc.nextInt();
        }
        d[q] = Integer.MAX_VALUE;
        
        for (int i = 0; i < n; i++) {
            int l;
            int r;

            l = binSearch(s[i] - x[i]);
            r = binSearch(t[i] - x[i]);

            rmq.update(l, r, x[i]);
        }

        for (int i = 0; i < q; i++) {
            int x = rmq.rangeMin(i, i + 1);

            if (x == Integer.MAX_VALUE) {
                out.println(-1);
            }
            else {
                out.println(x);
            }
        }

        out.flush();
    }

    public static int binSearch(int terget) {
        int valid = q;
        int invalid = -1;

        while (valid - invalid > 1) {
            int mid = (invalid + valid) / 2;

            if (d[mid] < terget) {
                invalid = mid;
            }
            else {
                valid = mid;
            }
        }

        return valid;
    }
}

class SqrtDecomposition {
    int[] lazy;
    int[] bucket;
    int[] raw_data;
    final int e = Integer.MAX_VALUE;

    int N;
    int sqrtN;
    int K;

    public SqrtDecomposition(int n) {
        N = n;
        sqrtN = 1;
        while (sqrtN * sqrtN < N) {
            sqrtN++;
        }

        K = (N + sqrtN - 1) / sqrtN;

        lazy = new int[K];
        bucket = new int[K];
        raw_data = new int[N];

        Arrays.fill(lazy, e);
        Arrays.fill(bucket, e);
        Arrays.fill(raw_data, e);
    }

    public void update(int l, int r, int d) {

        for (int k = 0; k < K; k++) {
            int bl = k * sqrtN;
            int br = (k + 1) * sqrtN;

            if (br <= l || r <= bl) {
                continue;
            }
            else if (l <= bl && br <= r) {
                lazy[k] = Math.min(lazy[k], d);
            }
            else {
                
                int x = e;
                for (int i = bl; i < Math.min(N, br); i++) {
                    if (l <= i && i < r) {
                        raw_data[i] = Math.min(raw_data[i], d);
                    }
                    x = Math.min(x, raw_data[i]);
                }
                bucket[k] = x;
            }
        }
    }

    public int rangeMin(int l, int r) {
        int x = e;

        for (int k = 0; k < K; k++) {
            int bl = k * sqrtN;
            int br = (k + 1) * sqrtN;

            if (br <= l || r <= bl) {
                continue;
            }
            else if (l <= bl && br <= r) {
                x = Math.min(x, Math.min(bucket[k], lazy[k]));
            }
            else {
                eval(k);
                for (int i = Math.max(bl, l); i < Math.min(br, r); i++) {
                    x = Math.min(raw_data[i], x);
                }
            }
        }

        return x;
    }

    protected void eval(int k)
    {
        int l = k * sqrtN;
        int r = (k + 1) * sqrtN;
        int x = e;

        for (int i = l; i < Math.min(N, r); i++) {
            raw_data[i] = Math.min(raw_data[i], lazy[k]);
            x = Math.min(raw_data[i], x);
        }

        bucket[k] = x;
        lazy[k] = e;
    }
}
