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.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;
import java.util.SortedSet;
import java.util.TreeSet;
import java.util.stream.Collectors;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        int Q = sc.nextInt();
        int[] S = new int[N];
        int[] T = new int[N];
        int[] X = new int[N];
        for (int i = 0; i < N; ++i) {
            S[i] = sc.nextInt();
            T[i] = sc.nextInt();
            X[i] = sc.nextInt();
        }
        int[] D = new int[Q];
        for (int i = 0; i < D.length; ++i) {
            D[i] = sc.nextInt();
        }

        System.out.println(solve(S, T, X, D));

        sc.close();
    }

    static String solve(int[] S, int[] T, int[] X, int[] D) {
        @SuppressWarnings("unchecked")
        List<Integer>[] beginLists = new List[D.length];
        for (int i = 0; i < beginLists.length; ++i) {
            beginLists[i] = new ArrayList<>();
        }

        @SuppressWarnings("unchecked")
        List<Integer>[] endLists = new List[D.length];
        for (int i = 0; i < endLists.length; ++i) {
            endLists[i] = new ArrayList<>();
        }

        for (int i = 0; i < S.length; ++i) {
            int leftIndex = findLeftIndex(D, S[i] - X[i]);
            int rightIndex = findRightIndex(D, T[i] - X[i]);

            if (leftIndex <= rightIndex) {
                beginLists[leftIndex].add(X[i]);
                endLists[rightIndex].add(X[i]);
            }
        }

        int[] result = new int[D.length];
        SortedSet<Integer> blocked = new TreeSet<>();
        for (int i = 0; i < result.length; ++i) {
            blocked.addAll(beginLists[i]);

            result[i] = blocked.isEmpty() ? -1 : blocked.first();

            blocked.removeAll(endLists[i]);
        }

        return Arrays.stream(result).mapToObj(String::valueOf).collect(Collectors.joining("\n"));
    }

    static int findLeftIndex(int[] D, int start) {
        int result = D.length;
        int lower = 0;
        int upper = D.length - 1;
        while (lower <= upper) {
            int middle = (lower + upper) / 2;
            if (D[middle] >= start) {
                result = middle;
                upper = middle - 1;
            } else {
                lower = middle + 1;
            }
        }

        return result;
    }

    static int findRightIndex(int[] D, int end) {
        int result = -1;
        int lower = 0;
        int upper = D.length - 1;
        while (lower <= upper) {
            int middle = (lower + upper) / 2;
            if (D[middle] < end) {
                result = middle;
                lower = middle + 1;
            } else {
                upper = middle - 1;
            }
        }

        return result;
    }
}