#include<bits/stdc++.h>
using namespace std;
#define forr(i,a,n)     for(long long int i=a; i<n; i++)
#define loop(i,a,n)     for(long long int i=a; i>=n; i--) 

int main()
{
	ios_base :: sync_with_stdio(false),cin.tie(NULL);

	int a, b, c, aa, flag=0;
	cin>>a>>b>>c;
	aa=a;
	int x1=0, y1=0;
	forr(i, 0, b)
	{
		int x, y;
		cin>>x>>y;
		//cout<<x<<' '<<y<<' '<<x1<<' '<<y1<<"  ";
		a-=(x-y1);
		//cout<<a<<' ';
		if(a<=0)
			flag=1;
		a+=(y-x);
		a=min(a, aa);
		//cout<<a<<'\n';
		if(a<=0)
			flag=1;
		x1=x, y1=y;
	}
	a-=(c-y1);
	if(a<=0)
		flag=1;
	cout<<(flag?"No":"Yes");
	
	return 0;
}
#include <bits/stdc++.h>

using namespace std;

#define LL long int

#define MOD const LL 1000000007;

int ans = 0;

int main(){
    int n,m,t;
    cin >> n >> m >> t;
    vector<int> a(m);
    vector<int> b(m);
    int max = n;

    for(int i = 0; i < m; ++i){
        cin >> a[i] >> b[i];
    }

    int x = 0;

    for(int i = 0; i < m; ++i){
        n -= a[i] - x;
        if(n <= 0){cerr << i << endl;
            cout << "No" << endl;
            return 0;
        }

        n = min(n + (b[i] - a[i]),max);
        x = b[i];
    }

    n -= t - x;
    if(n <= 0){
            cout << "No" << endl;
    }else{
        cout << "Yes" << endl;
    }


    return 0;
}