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

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Eric
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        ERoadwork solver = new ERoadwork();
        solver.solve(1, in, out);
        out.close();
    }

    static class ERoadwork {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int q = in.nextInt();

            ArrayList<ERoadwork.Event> events = new ArrayList<>();
            for (int i = 0; i < n; i++) {
                int s = in.nextInt();
                int t = in.nextInt();
                int x = in.nextInt();

                events.add(new ERoadwork.Event(s - x, x, 2));
                events.add(new ERoadwork.Event(t - x, x, 1));
            }
            for (int i = 0; i < q; i++) {
                events.add(new ERoadwork.Event(in.nextInt(), i, 3));
            }

            Collections.sort(events);

            TreeSet<Integer> currents = new TreeSet<>();
            int[] res = new int[q];
            for (ERoadwork.Event event : events)
                if (event.type == 2)
                    currents.add(event.x);
                else if (event.type == 1)
                    currents.remove(event.x);
                else {
                    res[event.x] = currents.isEmpty() ? -1 : currents.first();
                }

            for (int i = 0; i < q; i++) {
                out.println(res[i]);
            }

        }

        public static class Event implements Comparable<ERoadwork.Event> {
            int t;
            int x;
            int type;

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

            public int compareTo(ERoadwork.Event o) {
                return t != o.t ? t - o.t : (type != o.type ? type - o.type : x - o.x);
            }

        }

    }
}

