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

public class Main {

    static BufferedReader br;
    static StringTokenizer st;

    public enum EventType {
        INSERT,
        DELETE,
        QUERY
    }

    public static class Event {
        final long time;
        final EventType type;
        final long x;

        public Event(final long time, final EventType type, final long x) {
            this.time = time;
            this.type = type;
            this.x = x;
        }
    }

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

        long N;
        N = readLong();
        long Q;
        Q = readLong();
        final List<Event> events = new ArrayList<>();
        for(int i = 0 ; i < N ; i++){
            long S = readLong();
            long T = readLong();
            long X = readLong();

            events.add(new Event(S - X, EventType.INSERT, X));
            events.add(new Event(T - X, EventType.DELETE, X));
        }

        for(int i = 0 ; i < Q ; i++){
            final long D = readLong();
            events.add(new Event(D, EventType.QUERY, i));
        }

        final Solver solver = new Solver();
        solver.solve(Q, events);
    }

    static String next() throws IOException {
        while (st == null || !st.hasMoreTokens())
            st = new StringTokenizer(br.readLine().trim());
        return st.nextToken();
    }

    static long readLong() throws IOException {
        return Long.parseLong(next());
    }
}

class Solver {
    public void solve(long Q, List<Main.Event> events) {
        events.sort(Comparator.comparingLong(e -> e.time));

        long[] ANS = new long[(int)(Q)];
        final TreeSet<Long> blocks = new TreeSet<>();

        for (final Main.Event event : events) {
            switch (event.type) {
                case INSERT:
                    blocks.add(event.x);
                    break;
                case DELETE:
                    blocks.remove(event.x);
                    break;
                case QUERY:
                    ANS[(int) event.x] = blocks.isEmpty() ? -1 : blocks.first();
                    break;
            }
        }

        for (final long ans : ANS) {
            System.out.println(ans);
        }
    }
}

