#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <iomanip>
#include <set>
using ll = long long;
const double PI = 3.1415926535897932;
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

int main()
{
    int n, m, t;
    int a[1010];
    int b[1010];

    cin >> n >> m >> t;

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

    b[0] = 0;
    bool bat = true;
    int battery = n;
    for(int j = 1; j <= m; j++)
    {
        battery -= a[j] - b[j - 1]; if(battery <= 0) bat = false;
        battery += b[j] - a[j]; if(battery > n) battery = n;
    }
    battery -= t - b[m]; if(battery <= 0) bat = false;

    if(bat) cout << "Yes" << endl;
    else cout << "No" << endl;
}
//debug icin gdb kullanmayi dene
#include<bits/stdc++.h>
using namespace std;
#define mods 1000000007
#define pb push_back
#define mp make_pair
#define st first
#define nd second
#define rs resize
#define pii pair<lint,lint> 
#define piii pair<lint,pair<lint,lint> > 
#define inf LLONG_MAX-7
#define vvL vector<vector<lint> > 
#define vvB vector<vector<bool> > 
#define vvvL vector<vector<vector<lint> > > 
#define vL vector<lint> 
#define vB vector<bool> 
typedef long long int lint;
typedef unsigned long long int ulint;
lint fastpow(lint tab,lint us){
	if(tab==0) return 0;
	if(tab==1) return 1;
	if(us==0) return 1;
	if(us==1) return tab%mods;
	tab%=mods;
	if(us%2==1) return tab*fastpow(tab,us-1)%mods;
	lint a=fastpow(tab,us/2)%mods;
	return a*a%mods;
}
lint t=1;

void solve(){
	lint l=0,a,b,i,j,k,n,m,T,sum;
	cin>>n>>m>>T;
	sum=n;
	for(i=0;i<m;i++){
		cin>>a;
		n-=a-l;
		if(n<=0){cout<<"No"<<endl; return;}
		cin>>b;
		n+=b-a;
		n=fmin(n,sum);
		l=b;
	}
	n-=T-l;
	if(n<=0){cout<<"No"<<endl; return;}
	cout<<"Yes"<<endl;
	return;
}

int main(){
//	freopen("in.txt","r",stdin);freopen("out.txt","w",stdout);
	ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
//	cin>>t;
	while(t--) solve();
	return 0;
}

