#pragma GCC optimize("Ofast")
#pragma GCC optimization ("unroll-loops")
 
#include <bits/stdc++.h>
 
#define IOS ios_base::sync_with_stdio(0); cin.tie(0);
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define ff first
#define ss second
#define ins insert
#define sz(x) (int)x.size()
#define dbg(x) cout << x << "\n";
 
const int N = 2e5 + 5;
const long long int mod = 1e9 + 7;
const long long int Mod = 998244353;
const long double Pi = acos(-1);
const long long int Inf = 4e18;
const long double Eps = 1e-9;
 
int dx[9] = {0, 1, -1, 0, 0, 1, 1, -1, -1};
int dy[9] = {0, 0, 0, 1, -1, 1, -1, 1, -1};
 
using namespace std;

#define int long long int 
 
void TestCase (){
        int n, q;
        cin >> n >> q;
        vector <int> a(n + 1, 0), b(n + 2, 0);
        for(int i = 1; i<=n; i++){
                cin >> a[i];
                if(i == 1) b[i] = a[i] - 1;
                else b[i] = b[i - 1] + a[i] - a[i - 1] - 1;
        }
        b[n + 1] = Inf;
        while(q--){
                int k;
                cin >> k;

                int lb = 1, ub = n + 1, pos = n + 2;
                while(lb <= ub){
                        int mid = (lb + ub) / 2;
                        if(k <= b[mid]){
                                pos = min(pos, mid);
                                ub = mid - 1;
                        }
                        else lb = mid + 1;
                }
                
                k -= b[pos - 1];
                cout << a[pos - 1] + k << "\n";
        }
}

#undef int
 
int main(){
        IOS;
        int T = 1;
        // cin >> T;
        while(T--){
                TestCase();
                cout << "\n";
        }
        return 0;
}
#include <bits/stdc++.h>
#define Fr(i,a,b) for(int i=(a);i<=(b);++i)
#define Fl(i,a,b) for(int i=(a);i>=(b);--i)
#define Fe(i,u) for(int i=H[u];i;i=e[i].nx)
#define ms(a,x) memset((a),(x),sizeof(a));
using namespace std;
int N,W;
long long p[200005],f;
int main()
{
	scanf("%d%d",&N,&W);
	Fr(i,1,N)
	{
		int s,t,x;
		scanf("%d%d%d",&s,&t,&x);
		p[s]+=x,p[t]-=x;
	}
	Fr(i,0,200000)
	{
		f+=p[i];
		if(f>W)
		{
			cout<<"No";
			return 0;
		}
	}
	cout<<"Yes";
}
