There is an infinitely long street that runs west to east, which we consider as a number line.

There are N roadworks scheduled on this street. The i-th roadwork blocks the point at coordinate X_i from time S_i - 0.5 to time T_i - 0.5.

Q people are standing at coordinate 0. The i-th person will start the coordinate 0 at time D_i, continue to walk with speed 1 in the positive direction and stop walking when reaching a blocked point.

Find the distance each of the Q people will walk.

Constraints

* All values in input are integers.
* 1 \leq N, Q \leq 2 \times 10^5
* 0 \leq S_i < T_i \leq 10^9
* 1 \leq X_i \leq 10^9
* 0 \leq D_1 < D_2 < ... < D_Q \leq 10^9
* If i \neq j and X_i = X_j, the intervals [S_i, T_i) and [S_j, T_j) do not overlap.

Input

Input is given from Standard Input in the following format:


N Q
S_1 T_1 X_1
:
S_N T_N X_N
D_1
:
D_Q


Output

Print Q lines. The i-th line should contain the distance the i-th person will walk or -1 if that person walks forever.

Example

Input

4 6
1 3 2
7 13 10
18 20 13
3 4 2
0
1
2
3
5
8


Output

2
2
10
-1
13
-1
#include <bits/stdc++.h>
using namespace std;
#define rep(i,l) for(int i=0;i<l;i++)
#define FOR(i,l,r) for(int i=l;i<=r;i++)
#define in(x) scanf("%d",&x)
#define lin(x) scanf("%lld",&x)
#define out(x) printf("%d\n",x)
#define lout(x) printf("%lld\n",x)
typedef long long ll;
const int N=3e5;
typedef struct node{
	ll s,t,x;	
}NODE;
NODE stu[N];
bool cmp(NODE a,NODE b){
	return a.x<b.x;
}
set<pair<ll,ll> >s;
ll n,q,d[N],a[N],ans[N];
signed main(){
	lin(n),lin(q);
	rep(i,n){
		lin(stu[i].s),lin(stu[i].t),lin(stu[i].x);
	}
	sort(stu,stu+n,cmp);
	rep(i,q){
		lin(d[i]);
		s.insert({d[i],i});
		ans[i]=-1;
	}
	rep(i,n){
		set<pair<ll,ll> >::iterator it;
		it=s.lower_bound({stu[i].s-stu[i].x,0});
		while(it!=s.end()){
			if((it->first)>=(stu[i].t-stu[i].x))break;
			ans[it->second]=stu[i].x;
			s.erase(it++);
		}
	}
	rep(i,q){
		cout<<ans[i]<<endl;
	}
	return 0;
}