import math from bisect import bisect_left, bisect_right from typing import Generic, Iterable, Iterator, TypeVar, Optional, List T = TypeVar('T') class SortedSet(Generic[T]): BUCKET_RATIO = 50 REBUILD_RATIO = 170 def _build(self, a=None) -> None: "Evenly divide `a` into buckets." if a is None: a = list(self) size = self.size = len(a) bucket_size = int(math.ceil(math.sqrt(size / self.BUCKET_RATIO))) self.a = [a[size * i // bucket_size : size * (i + 1) // bucket_size] for i in range(bucket_size)] def __init__(self, a: Iterable[T] = []) -> None: "Make a new SortedSet from iterable. / O(N) if sorted and unique / O(N log N)" a = list(a) if not all(a[i] < a[i + 1] for i in range(len(a) - 1)): a = sorted(set(a)) self._build(a) def __iter__(self) -> Iterator[T]: for i in self.a: for j in i: yield j def __reversed__(self) -> Iterator[T]: for i in reversed(self.a): for j in reversed(i): yield j def __len__(self) -> int: return self.size def __repr__(self) -> str: return "SortedSet" + str(self.a) def __str__(self) -> str: s = str(list(self)) return "{" + s[1 : len(s) - 1] + "}" def _find_bucket(self, x: T) -> List[T]: "Find the bucket which should contain x. self must not be empty." for a in self.a: if x <= a[-1]: return a return a def __contains__(self, x: T) -> bool: if self.size == 0: return False a = self._find_bucket(x) i = bisect_left(a, x) return i != len(a) and a[i] == x def add(self, x: T) -> bool: "Add an element and return True if added. / O(√N)" if self.size == 0: self.a = [[x]] self.size = 1 return True a = self._find_bucket(x) i = bisect_left(a, x) if i != len(a) and a[i] == x: return False a.insert(i, x) self.size += 1 if len(a) > len(self.a) * self.REBUILD_RATIO: self._build() return True def discard(self, x: T) -> bool: "Remove an element and return True if removed. / O(√N)" if self.size == 0: return False a = self._find_bucket(x) i = bisect_left(a, x) if i == len(a) or a[i] != x: return False a.pop(i) self.size -= 1 if len(a) == 0: self._build() return True def lt(self, x: T) -> Optional[T]: "Find the largest element < x, or None if it doesn't exist." for a in reversed(self.a): if a[0] < x: return a[bisect_left(a, x) - 1] def le(self, x: T) -> Optional[T]: "Find the largest element <= x, or None if it doesn't exist." for a in reversed(self.a): if a[0] <= x: return a[bisect_right(a, x) - 1] def gt(self, x: T) -> Optional[T]: "Find the smallest element > x, or None if it doesn't exist." for a in self.a: if a[-1] > x: return a[bisect_right(a, x)] def ge(self, x: T) -> Optional[T]: "Find the smallest element >= x, or None if it doesn't exist." for a in self.a: if a[-1] >= x: return a[bisect_left(a, x)] def __getitem__(self, x: int) -> T: "Return the x-th element, or IndexError if it doesn't exist." if x < 0: x += self.size if x < 0: raise IndexError for a in self.a: if x < len(a): return a[x] x -= len(a) raise IndexError def index(self, x: T) -> int: "Count the number of elements < x." ans = 0 for a in self.a: if a[-1] >= x: return ans + bisect_left(a, x) ans += len(a) return ans def index_right(self, x: T) -> int: "Count the number of elements <= x." ans = 0 for a in self.a: if a[-1] > x: return ans + bisect_right(a, x) ans += len(a) return N=int(input()) X=[[] for i in range(100002)] for i in range(N): l,r,a=map(int,input().split()) if a>100000: continue X[a].append((l,r+1)) def kukan_iikanjini(x): S=set([1,(10**9)+2]) for i in range(len(x)): S.add(x[i][0]) S.add(x[i][1]) S=sorted(S) D=dict() M=len(S) for i in range(M): D[S[i]]=i C=[0]*(M+1) for i in range(len(x)): C[D[x[i][0]]]+=1 C[D[x[i][1]]]-=1 for i in range(M): C[i+1]+=C[i] L=0 r=[] for i in range(M): if C[i]==0: if L==0: L=S[i] else: if L>0: r.append((L,S[i])) L=0 if L>0: r.append((L,10**9+2)) return r for i in range(100002): if len(X[i]): X[i]=kukan_iikanjini(X[i]) else: X[i]=[-1] Q=int(input()) Y=list(map(int,input().split())) YY=dict() for i in range(Q): YY[Y[i]]=i MAX=1234567890 YY[MAX]=-1 Y.append(MAX) SS=SortedSet(a=Y) ANS=[100000000]*Q for i in range(100002): if len(X[i])==1 and X[i]==[-1]: for j in range(Q): ANS[j]=min(ANS[j],i) break for j in range(len(X[i])): l,r=X[i][j][0],X[i][j][1] while 1: v=SS.ge(l) if v>=r: break SS.discard(v) ANS[YY[v]]=i print(*ANS,sep='\n')