using System;
using System.Collections.Generic;
using System.Globalization;
using System.IO;
using System.Linq;

partial class Solver
{
    public class Data
    {
        public int Id { get; set; }
        public int Value { get; set; }
    }

    public void Run()
    {
        var N = ni();
        var Q = ni();
        var S = new int[N];
        var T = new int[N];
        var X = new int[N];
        for (int i = 0; i < N; i++)
        {
            S[i] = ni();
            T[i] = ni();
            X[i] = ni();
        }
        var D = ni(Q);

        var stopInfo = Enumerable.Range(0, N)
            .SelectMany(i => new[]
            {
                new { IsPush = true, Time = S[i] - X[i], X = X[i], Id = i },
                new { IsPush = false, Time = T[i] - X[i], X = X[i], Id = i },
            })
            .OrderBy(t => t.Time)
            .ThenBy(t => t.IsPush ? 1 : 0)
            .ToArray();

        var isRemoved = new bool[N];

        var pq = new PriorityQueue<Data>((d1, d2) => d1.Value.CompareTo(d2.Value));
        int cur = 0;
        foreach (var d in D)
        {
            while (cur < stopInfo.Length)
            {
                var info = stopInfo[cur];
                if (info.Time <= d)
                {
                    cur++;
                    if (info.IsPush)
                    {
                        if (!isRemoved[info.Id])
                        {
                            pq.Enqueue(new Data
                            {
                                Id = info.Id,
                                Value = info.X
                            });
                        }
                    }
                    else
                    {
                        isRemoved[info.Id] = true;
                    }
                }
                else
                {
                    break;
                }
            }

            int ans = -1;

            while (pq.Any())
            {
                var top = pq.Peek();
                if (isRemoved[top.Id])
                {
                    pq.Dequeue();
                }
                else
                {
                    ans = top.Value;
                    break;
                }
            }
            cout.WriteLine(ans);
        }
        cout.Flush();
    }
}


public class PriorityQueue<T>
{
    private T[] array = new T[100];
    private int size = 0;
    private readonly Comparer<T> _comparer;

    public PriorityQueue()
    {
        this._comparer = Comparer<T>.Default;
    }

    public PriorityQueue(Comparison<T> comp)
    {
        this._comparer = Comparer<T>.Create(comp);
    }

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

    private void Expand()
    {
        var newlist = new T[array.Length * 2];
        Array.Copy(array, newlist, array.Length);
        array = newlist;
    }

    public bool Any()
    {
        return size > 0;
    }

    public void Enqueue(T newValue)
    {
        if (size >= array.Length)
        {
            Expand();
        }
        array[size++] = newValue;
        int pos = size - 1;
        while (pos > 0)
        {
            int parent = (pos - 1) / 2;
            if (_comparer.Compare(array[parent], array[pos]) > 0)
            {
                Swap(parent, pos);
                pos = parent;
            }
            else
                break;
        }
    }

    public T Peek()
    {
        return array[0];
    }

    public T Dequeue()
    {
        var top = array[0];
        array[0] = array[--size];
        int pos = 0;
        while (pos * 2 + 1 < size)
        {
            int left = pos * 2 + 1;
            int right = left + 1;
            int next = left;
            if (right < size && _comparer.Compare(array[left], array[right]) > 0)
                next = right;

            if (_comparer.Compare(array[pos], array[next]) > 0)
            {
                Swap(next, pos);
                pos = next;
            }
            else
                break;
        }

        return top;
    }
};



// PREWRITEN CODE BEGINS FROM HERE
partial class Solver : Scanner
{
    public static void Main(string[] args)
    {
        var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
        Console.SetOut(sw);
        new Solver(Console.In, Console.Out).Run();
    }

    TextReader cin;
    TextWriter cout;

    public Solver(TextReader reader, TextWriter writer)
        : base(reader)
    {
        this.cin = reader;
        this.cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer)
    {
    }

    public int ni() { return NextInt(); }
    public int[] ni(int n) { return NextIntArray(n); }
    public long nl() { return NextLong(); }
    public long[] nl(int n) { return NextLongArray(n); }
    public double nd() { return NextDouble(); }
    public string ns() { return Next(); }
}

public class Scanner
{
    private TextReader Reader;
    private Queue<String> TokenQueue = new Queue<string>();
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    public Scanner()
        : this(Console.In)
    {
    }

    public Scanner(TextReader reader)
    {
        this.Reader = reader;
    }

    public int NextInt() { return Int32.Parse(Next(), ci); }
    public long NextLong() { return Int64.Parse(Next(), ci); }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size)
    {
        var array = new string[size];
        for (int i = 0; i < size; i++) array[i] = Next();
        return array;
    }
    public int[] NextIntArray(int size)
    {
        var array = new int[size];
        for (int i = 0; i < size; i++) array[i] = NextInt();
        return array;
    }

    public long[] NextLongArray(int size)
    {
        var array = new long[size];
        for (int i = 0; i < size; i++) array[i] = NextLong();
        return array;
    }

    public String Next()
    {
        if (TokenQueue.Count == 0)
        {
            if (!StockTokens()) throw new InvalidOperationException();
        }
        return TokenQueue.Dequeue();
    }

    public bool HasNext()
    {
        if (TokenQueue.Count > 0)
            return true;
        return StockTokens();
    }

    private bool StockTokens()
    {
        while (true)
        {
            var line = Reader.ReadLine();
            if (line == null) return false;
            var tokens = line.Trim().Split(" ".ToCharArray(), StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) continue;
            foreach (var token in tokens)
                TokenQueue.Enqueue(token);
            return true;
        }
    }
}


Measured memory_bytes: 55756