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.Arrays;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.Reader;
import java.io.InputStreamReader;
import java.util.TreeSet;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        MyInput in = new MyInput(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, MyInput in, PrintWriter out) {
            int n = in.nextInt();
            int q = in.nextInt();

            TreeSet<Integer> set = new TreeSet<>();
            int[][] stop = new int[n][];
            for (int i = 0; i < n; i++) {
                int s = in.nextInt();
                int t = in.nextInt();
                int x = in.nextInt();

                stop[i] = new int[]{s - x, t - x, x};
                set.add(stop[i][0]);
                set.add(stop[i][1]);
            }
            int[] ts = in.nextIntArray(q);
            for (int t : ts) set.add(t);


            int[] cmp = new int[set.size()];
            for (int i = 0; i < cmp.length; i++) {
                cmp[i] = set.pollFirst();
            }

            Seg1 seg = new Seg1(cmp.length);
            int[] time = new int[cmp.length];
            for (int i = 0; i < stop.length; i++) {
                int l = Arrays.binarySearch(cmp, stop[i][0]);
                int r = Arrays.binarySearch(cmp, stop[i][1]);
                seg.update(l, r, stop[i][2]);
            }

            for (int t : ts) {
                int idx = Arrays.binarySearch(cmp, t);
                int ans = seg.get(idx);
                if (ans == Integer.MAX_VALUE) ans = -1;
                out.println(ans);
            }
        }

        class Seg1 {
            final int n;
            final int[] seg;

            public Seg1(final int n) {
                this.n = Integer.highestOneBit(n) << 1;
                seg = new int[this.n << 1];
                Arrays.fill(seg, Integer.MAX_VALUE);
            }

            void update(int l, int r, int v) {
                update(l, r, v, 0, 0, n);
            }

            void update(int l, int r, int v, int k, int curL, int curR) {
                if (curR <= l || curL >= r) {
                    return;
                }
                if (l <= curL && curR <= r) {
                    seg[k] = Math.min(seg[k], v);
                    return;
                }
                final int curM = (curL + curR) / 2;
                update(l, r, v, 2 * k + 1, curL, curM);
                update(l, r, v, 2 * k + 2, curM, curR);
            }

            int get(int i) {
                i += n - 1;
                int ret = seg[i];
                while (i != 0) {
                    i = (i - 1) / 2;
                    ret = Math.min(ret, seg[i]);
                }
                return ret;
            }

        }

    }

    static class MyInput {
        private final BufferedReader in;
        private static int pos;
        private static int readLen;
        private static final char[] buffer = new char[1024 * 8];
        private static char[] str = new char[500 * 8 * 2];
        private static boolean[] isDigit = new boolean[256];
        private static boolean[] isSpace = new boolean[256];
        private static boolean[] isLineSep = new boolean[256];

        static {
            for (int i = 0; i < 10; i++) {
                isDigit['0' + i] = true;
            }
            isDigit['-'] = true;
            isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true;
            isLineSep['\r'] = isLineSep['\n'] = true;
        }

        public MyInput(InputStream is) {
            in = new BufferedReader(new InputStreamReader(is));
        }

        public int read() {
            if (pos >= readLen) {
                pos = 0;
                try {
                    readLen = in.read(buffer);
                } catch (IOException e) {
                    throw new RuntimeException();
                }
                if (readLen <= 0) {
                    throw new MyInput.EndOfFileRuntimeException();
                }
            }
            return buffer[pos++];
        }

        public int nextInt() {
            int len = 0;
            str[len++] = nextChar();
            len = reads(len, isSpace);
            int i = 0;
            int ret = 0;
            if (str[0] == '-') {
                i = 1;
            }
            for (; i < len; i++) ret = ret * 10 + str[i] - '0';
            if (str[0] == '-') {
                ret = -ret;
            }
            return ret;
        }

        public char nextChar() {
            while (true) {
                final int c = read();
                if (!isSpace[c]) {
                    return (char) c;
                }
            }
        }

        int reads(int len, boolean[] accept) {
            try {
                while (true) {
                    final int c = read();
                    if (accept[c]) {
                        break;
                    }
                    if (str.length == len) {
                        char[] rep = new char[str.length * 3 / 2];
                        System.arraycopy(str, 0, rep, 0, str.length);
                        str = rep;
                    }
                    str[len++] = (char) c;
                }
            } catch (MyInput.EndOfFileRuntimeException e) {
            }
            return len;
        }

        public int[] nextIntArray(final int n) {
            final int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt();
            }
            return res;
        }

        static class EndOfFileRuntimeException extends RuntimeException {
        }

    }
}

