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.PrintWriter;
import java.util.*;

public class Main {
    int n, q;
    int[] s, t, x;
    int[] ds;
    int[] d;
    long INF = 1L << 60;

    // d + xi が [li, ri) に含まれる最初のxi
    // li <= d + xi < ri
    // li - xi <= d < ri - xi

    void run() {
        Scanner sc = new Scanner(System.in);
        n = sc.nextInt();
        q = sc.nextInt();
        s = new int[n];
        t = new int[n];
        x = new int[n];

        PriorityQueue<Event> que = new PriorityQueue<>();

        for (int i = 0; i < n; i++) {
            s[i] = sc.nextInt();
            t[i] = sc.nextInt();
            x[i] = sc.nextInt();

            que.add(new Event(s[i] - x[i], x[i], 1));
            que.add(new Event(t[i] - x[i], x[i], 0));
        }

        ds = new int[q];
        int c = 0;
        for (int i = 0; i < q; i++) {
            ds[i] = sc.nextInt();
            que.add(new Event(ds[i], i, 2));
        }

        TreeSet<Integer> set = new TreeSet<>();
        int[] ans = new int[q];
        while (!que.isEmpty()) {
            Event e = que.remove();
            switch (e.type) {
                case 0:
                    set.remove(e.idx);
                    break;
                case 1:
                    set.add(e.idx);
                    break;
                case 2:
                    ans[e.idx] = set.isEmpty() ? -1: set.first();
            }
//            debug(e.t, e.type, e.idx, set);
        }
        PrintWriter out = new PrintWriter(System.out);
        for (int i = 0; i < q; i++) {
            out.println(ans[i]);
        }
        out.flush();
    }

    class Event implements Comparable<Event> {
        int t;
        int idx;
        // 0: end, 1: start, 2: query
        int type;

        Event(int t, int idx, int type) {
            this.t = t;
            this.idx = idx;
            this.type = type;
        }

        @Override
        public int compareTo(Event o) {
            if (t == o.t) {
                return type - o.type;
            }
            return t - o.t;
        }
    }

    void debug(Object... os) {
        System.err.println(Arrays.deepToString(os));
    }

    public static void main(String[] args) {
        new Main().run();
    }
}
