import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.Comparator;
import java.util.TreeSet;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author KharYusuf
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        FastReader in = new FastReader(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, FastReader s, PrintWriter w) {
            int n = s.nextInt(), q = s.nextInt(), si, ti, x, ans[] = new int[q];
            pair<Integer, pair<Integer, Integer>> p[] = new pair[(n << 1) + q];
            for (int i = 0; i < n; i++) {
                si = s.nextInt();
                ti = s.nextInt();
                x = s.nextInt();
                p[i << 1] = new pair(si - x, new pair(x, 1));
                p[(i << 1) + 1] = new pair(ti - x, new pair(x, -1));
            }
            n <<= 1;
            for (int i = 0; i < q; i++) {
                p[i + n] = new pair(s.nextInt(), new pair(i, 0));
            }
            Arrays.sort(p, new Comparator<pair<Integer, pair<Integer, Integer>>>() {

                public int compare(pair<Integer, pair<Integer, Integer>> o1, pair<Integer, pair<Integer, Integer>> o2) {
                    return o1.x.compareTo(o2.x);
                }
            });
            TreeSet<Integer> t = new TreeSet<>();
            for (pair<Integer, pair<Integer, Integer>> pi : p) {
                if (pi.y.y == 1) t.add(pi.y.x);
                else if (pi.y.y == -1) t.remove(pi.y.x);
                else ans[pi.y.x] = t.size() == 0 ? -1 : t.first();
            }
            for (int i : ans) w.println(i);
        }

    }

    static class FastReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private FastReader.SpaceCharFilter filter;

        public FastReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {

            if (numChars == -1)
                throw new InputMismatchException();

            if (curChar >= numChars) {

                curChar = 0;

                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }

                if (numChars <= 0)
                    return -1;
            }

            return buf[curChar++];
        }

        public int nextInt() {

            int c = read();

            while (isSpaceChar(c))
                c = read();

            int sgn = 1;

            if (c == '-') {
                sgn = -1;
                c = read();
            }

            int res = 0;

            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();

                res *= 10;
                res += c - '0';
                c = read();
            }
            while (!isSpaceChar(c));

            return res * sgn;
        }

        public boolean isSpaceChar(int c) {

            if (filter != null)
                return filter.isSpaceChar(c);

            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }

    static class pair<U extends Comparable<U>, V extends Comparable<V>> implements Comparable<pair<U, V>> {
        public U x;
        public V y;

        public pair(U x, V y) {
            this.x = x;
            this.y = y;
        }

        public int compareTo(pair<U, V> other) {
            if (this.x.compareTo(other.x) != 0) return this.x.compareTo(other.x);
            return this.y.compareTo(other.y);
        }

        public String toString() {
            return x.toString() + "," + y.toString();
        }

        public boolean equals(Object obj) {
            pair<U, V> other = (pair<U, V>) obj;
            return this.x.equals(other.x) && this.y.equals(other.y);
        }

        public int hashCode() {
            return toString().hashCode();
        }

    }
}



Measured memory_bytes: 131328