using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using static System.Console;
using static System.Math;

namespace AtTest.ABC_128
{
    class E
    {
        static void Main(string[] args)
        {
            Method(args);
        }

        static void Method(string[] args)
        {
            int[] nq = ReadInts();
            int n = nq[0];
            int q = nq[1];
            var array = new Event[2*n];
            for (int i = 0; i < n; i++)
            {
                int[] stxs = ReadInts();
                stxs[0] -= stxs[2];
                stxs[1] -= stxs[2];
                array[i * 2] = new Event(stxs[0], 1, stxs[2]);
                array[i * 2 + 1] = new Event(stxs[1], 0, stxs[2]);
            }
            Array.Sort(array);

            var qs = new int[q][];
            for (int i = 0; i < q; i++)
            {
                qs[i] = new int[2] { ReadInt(), i };
            }
            
            int[] res = new int[q];
            var dict = new SortedDictionary<int,bool>();
            int now = 0;
            for (int i = 0; i < q; i++)
            {
                while (now<2*n
                    && array[now].time <= qs[i][0])
                {
                    switch (array[now].no)
                    {
                        case 1:
                            dict.Add(array[now].pos,true);
                            break;
                        case 0:
                            dict.Remove(array[now].pos);
                            break;
                    }
                    now++;
                }
                if (dict.Count > 0) res[qs[i][1]] = dict.Keys.First();
                else res[qs[i][1]] = -1;
            }

            for (int i = 0; i < q; i++) WriteLine(res[i]);
        }

        struct Event : IComparable<Event>
        {
            public int time;
            public int no;
            public int pos;

            public Event(int time, int no, int pos)
            {
                this.time = time;
                this.no = no;
                this.pos = pos;
            }

            public int CompareTo(Event other)
            {
                if (time < other.time) return -1;
                if (time == other.time)
                {
                    if (no < other.no) return -1;
                    if (no == other.no) return 0;
                    else return 1;
                }
                else return 1;
            }
        }
        class PriorityQueue<T> where T : IComparable<T>
        {
            private readonly List<T> list;

            public int Count { get; private set; }

            public PriorityQueue()
            {
                list = new List<T>();
                Count = 0;
            }

            private void Add(T value)
            {
                if (Count == list.Count)
                {
                    list.Add(value);
                }
                else
                {
                    list[Count] = value;
                }
                Count++;
            }

            private void Swap(int a, int b)
            {
                T tmp = list[a];
                list[a] = list[b];
                list[b] = tmp;
            }

            public void Enqueue(T value)
            {
                Add(value);
                int c = Count - 1;
                while (c > 0)
                {
                    int p = (c - 1) / 2;
                    if (list[c].CompareTo(list[p]) >= 0) break;

                    Swap(p, c);
                    c = p;
                }
            }

            public T Top()
            {
                return list[0];
            }

            public T Dequeue()
            {
                T value = list[0];
                Count--;
                if (Count == 0) return value;

                list[0] = list[Count];
                int p = 0;
                while (true)
                {
                    int c1 = p * 2 + 1;
                    int c2 = p * 2 + 2;
                    if (c1 >= Count) break;

                    int c = (c2 >= Count || list[c1].CompareTo(list[c2]) == -1)
                        ? c1 : c2;
                    if (list[c].CompareTo(list[p]) >= 0) break;

                    Swap(p, c);
                    p = c;
                }
                return value;
            }
        }

        private static string Read() { return ReadLine(); }
        private static char[] ReadChars() { return Array.ConvertAll(Read().Split(), a => a[0]); }
        private static int ReadInt() { return int.Parse(Read()); }
        private static long ReadLong() { return long.Parse(Read()); }
        private static double ReadDouble() { return double.Parse(Read()); }
        private static int[] ReadInts() { return Array.ConvertAll(Read().Split(), int.Parse); }
        private static long[] ReadLongs() { return Array.ConvertAll(Read().Split(), long.Parse); }
        private static double[] ReadDoubles() { return Array.ConvertAll(Read().Split(), double.Parse); }
    }
}


Measured memory_bytes: 39544