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

public class Main {
    public static void main(String[] args) {
        MyScanner sc = new MyScanner();
        PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
        int n = sc.nextInt(); int q = sc.nextInt();
        ArrayList<Event> a = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            long start = sc.nextInt(); long end = sc.nextInt();
            long place = sc.nextInt();
            a.add(new Event(start - place, place, true));
            a.add(new Event(end - place, place, false));
        }
        for (int i = 0; i < q; i++) {
            long d = sc.nextInt();
            a.add(new Event(d));
        }
        Collections.sort(a);
        TreeSet<Long> set = new TreeSet<>();
        for (int i = 0; i < a.size(); i++) {
            Event e = a.get(i);
            if (e.query) {
                if (set.isEmpty()) {
                    out.println(-1);
                } else {
                    out.println(set.first());
                }
            } else {
                if (e.start) {
                    set.add(e.place);
                } else {
                    set.remove(e.place);
                }
            }
        }
        out.close();
    }

    static class Event implements Comparable<Event> {
        long time; long place;
        boolean query; boolean start;
        Event(long time) {
            this.query = true;
            this.time = time;
        }
        Event(long time, long place, boolean start) {
            this.time = time; this.place = place;
            this.query = false;
            this.start = start;
        }

        @Override
        public int compareTo(Event o) {
            if (time == o.time) {
                if (query) return 1;
                else if (o.query) return -1;
                else if (place != o.place) return Long.compare(place, o.place);
                else if (start) return 1;
                else return -1;
            }
            return Long.compare(time, o.time);
        }
    }


    //-----------MyScanner class for faster input----------
    public static class MyScanner {
        BufferedReader br;
        StringTokenizer st;

        public MyScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }


    }

}