#include <bits/stdc++.h>
using namespace std;
 
using ll = long long;
using str = string; 
 
using pi = pair<int,int>;
using pl = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>; 
 
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define lb lower_bound 
#define ub upper_bound 
 
constexpr int setbits(int x) { return __builtin_popcount(x); } 
constexpr int bits(int x) { return 32-__builtin_clz(x); } 
str binary(int x) { return bitset<32>(x).to_string(); } 
int decimal(str x) { return stoi(x,nullptr,2); } 
ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } 
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } 
 
const int nax = INT_MAX;
const int nim = INT_MIN;	
const int mod = 1000000007;

void solve(){
	ll n, m, t;
	cin >> n >> m >> t;
	vpi a(m);
	ll p = n;
	for(int i = 0; i < m; ++i)
		cin >> a[i].fi >> a[i].se;
	n -= a[0].fi;
	if(n <= 0){
		cout << "No" << endl;
		return;
	}
	n += (a[0].se - a[0].fi);
	n = min(p, n);
	for(int i = 1; i < m; ++i){
		n -= (a[i].fi - a[i-1].se);
		if(n <= 0){
			cout << "No" << endl;
			return;
		}
		n += (a[i].se - a[i].fi);
		n = min(p, n);
	}
	n -= (t - a[m-1].se);
	if(n <= 0)
		cout << "No" << endl;
	else
		cout << "Yes" << endl;
}

int main(){
	ios_base::sync_with_stdio(false), cin.tie(nullptr);
	int t = 1;
	//cin >> t;
	while(t--)
		solve();
}

#include<iostream>
using namespace std;
int main(){
    int N,S,D;
    cin >> N >> S >> D;

    for(int i=0;i<N;i++)
    {
        int a,b;
        cin >> a >> b;

        if(a < S && b > D){
            cout << "Yes" << endl;
            return 0;
        }
    }

    cout << "No" << endl;
    
}