package main

import (
	"bufio"
	"fmt"
	"math"
	"os"
	"strconv"
)

func getScanner(fp *os.File) *bufio.Scanner {
	scanner := bufio.NewScanner(fp)
	scanner.Split(bufio.ScanWords)
	scanner.Buffer(make([]byte, 1000005), 1000005)
	return scanner
}
func getNextString(scanner *bufio.Scanner) string {
	scanner.Scan()
	return scanner.Text()
}
func getNextInt(scanner *bufio.Scanner) int {
	i, _ := strconv.Atoi(getNextString(scanner))
	return i
}
func getNextInt64(scanner *bufio.Scanner) int64 {
	i, _ := strconv.ParseInt(getNextString(scanner), 10, 64)
	return i
}
func getNextUint64(scanner *bufio.Scanner) uint64 {
	i, _ := strconv.ParseUint(getNextString(scanner), 10, 64)
	return i
}
func getNextFloat64(scanner *bufio.Scanner) float64 {
	i, _ := strconv.ParseFloat(getNextString(scanner), 64)
	return i
}
func main() {
	fp := os.Stdin
	wfp := os.Stdout
	cnt := 0
	if os.Getenv("MASPY") == "ますピ" {
		fp, _ = os.Open(os.Getenv("BEET_THE_HARMONY_OF_PERFECT"))
		cnt = 0
	}
	if os.Getenv("MASPYPY") == "ますピッピ" {
		wfp, _ = os.Create(os.Getenv("NGTKANA_IS_GENIUS10"))
	}
	scanner := getScanner(fp)
	writer := bufio.NewWriter(wfp)
	solve(scanner, writer)
	for i := 0; i < cnt; i++ {
		fmt.Fprintln(writer, "-----------------------------------")
		solve(scanner, writer)
	}
	writer.Flush()
}
func solve(scanner *bufio.Scanner, writer *bufio.Writer) {
	n := getNextInt(scanner)
	q := getNextInt(scanner)
	ss := make([]int, n)
	tt := make([]int, n)
	xx := make([]int, n)
	dd := make([]int, q)
	dec := newDecomposition(q)
	for i := 0; i < q; i++ {
		dec.maximize(i, math.MaxInt32)
	}
	for i := 0; i < n; i++ {
		ss[i] = getNextInt(scanner)
		tt[i] = getNextInt(scanner)
		xx[i] = getNextInt(scanner)
	}
	for i := 0; i < q; i++ {
		dd[i] = getNextInt(scanner)
	}
	for i := 0; i < n; i++ {
		l := lower(-xx[i]+ss[i], q, dd)
		r := lower(-xx[i]+tt[i], q, dd)
		if l < r {
			dec.rangeMinimize(l, r, xx[i])
		}
	}
	for i := 0; i < q; i++ {
		ans := dec.get(i)
		if ans == math.MaxInt32 {
			fmt.Fprintln(writer, -1)
			continue
		}
		fmt.Fprintln(writer, ans)
	}
}

func lower(x, n int, xx []int) int {
	l := -1
	r := n
	for l+1 < r {
		m := l + (r-l)>>1
		if xx[m] < x {
			l = m
			continue
		}
		r = m
	}
	return r
}

type decomposition struct {
	chunk  int
	bucket [][]int
}

func newDecomposition(n int) decomposition {
	bucket := make([][]int, 1)
	bucket[0] = make([]int, n)
	chunk := 8
	for i := 0; n > 1; i++ {
		n = (n-1)/chunk + 1
		bucket = append(bucket, make([]int, n))
	}
	return decomposition{
		chunk:  chunk,
		bucket: bucket,
	}
}
func (dec *decomposition) upleft(l int) int {
	return (l + dec.chunk - 1) / dec.chunk
}
func (dec *decomposition) upright(r int) int {
	return r / dec.chunk
}
func (dec *decomposition) get(index int) int {
	h := len(dec.bucket)
	ans := dec.bucket[0][index]
	for i := 0; i < h; i++ {
		if ans > dec.bucket[i][index] {
			ans = dec.bucket[i][index]
		}
		index /= dec.chunk
	}
	return ans
}
func (dec *decomposition) minimize(index int, value int) {
	dec.bucket[0][index] = value
	h := len(dec.bucket)
	for i := 0; i < h-1; i++ {
		p := index / dec.chunk
		r := (p + 1) * dec.chunk
		if r >= len(dec.bucket[i]) {
			r = len(dec.bucket[i])
		}
		dec.bucket[i+1][p] = value
		for j := p * dec.chunk; j < r; j++ {
			if dec.bucket[i+1][p] > dec.bucket[i][j] {
				dec.bucket[i+1][p] = dec.bucket[i][j]
			}
		}
		index /= dec.chunk
	}
}
func (dec *decomposition) rangeMinimize(l, r, value int) {
	dec.rangeMinimizeh(l, r, 0, value)
}
func (dec *decomposition) rangeMinimizeh(l, r, h int, value int) {
	ll := dec.upleft(l)
	rr := dec.upright(r)
	for i := l; i < r && i < ll*dec.chunk; i++ {
		if dec.bucket[h][i] > value {
			dec.bucket[h][i] = value
		}
	}
	if ll < rr {
		dec.rangeMinimizeh(ll, rr, h+1, value)
	}
	for i := rr * dec.chunk; i < r && ll <= rr; i++ {
		if dec.bucket[h][i] > value {
			dec.bucket[h][i] = value
		}
	}
}
func (dec *decomposition) maximize(index int, value int) {
	dec.bucket[0][index] = value
	h := len(dec.bucket)
	for i := 0; i < h-1; i++ {
		p := index / dec.chunk
		r := (p + 1) * dec.chunk
		if r >= len(dec.bucket[i]) {
			r = len(dec.bucket[i])
		}
		dec.bucket[i+1][p] = value
		for j := p * dec.chunk; j < r; j++ {
			if dec.bucket[i+1][p] < dec.bucket[i][j] {
				dec.bucket[i+1][p] = dec.bucket[i][j]
			}
		}
		index /= dec.chunk
	}
}


Measured memory_bytes: 18560