#include<bits/stdc++.h>
#define M_PI       3.14159265358979323846
#define Speed_UP  ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define 	pb	push_back 
#define 	ff	first 
#define 	ss	second 
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#warning Remember to change t
inline void setIO();
using namespace std;
typedef long long ll;
typedef long double ld;

int solve(){
  ll n,m,t;
  cin>>n>>m>>t;
  vector<int>times(2*m+2);
  times[0]=0;
  for(int i=1;i<=2*m;i++){
    cin>>times[i];
  }
  times[2*m+1]=t;
  ll turn=0;
  ll curt=n;
  for(int i=0;i<=2*m;i++,turn^=1){
    ll j=i+1;
    if(turn==0){
      curt-=times[j]-times[i];
      if(curt<=0){
        cout<<"No";
        return 0;
      }
    }else{
      curt+=times[j]-times[i];
      if(curt>n)
        curt=n;
    }
   
  }
  cout<<"Yes";
  
  
  return 0;
  }
  
int main(){
	Speed_UP
	ll t = 1;
	while(t--){
		solve();
	}
}


inline void setIO(string name="") {
	#ifndef ONLINE_JUDGE 
	freopen((name+".in").c_str(), "r", stdin); 
	freopen((name+".out").c_str(), "w", stdout);
	#endif
	}

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define MOD 1000000007
#define MOD2 1000000009
#define endl "\n"
#define pii pair <int, int>
#define pll pair <ll, ll>
#define F first
#define S second



int main()
{
    IOS;
        #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
        #endif

    ll n, m, t;
    cin >> n >> m >> t;
    std::vector<pll> v(m);

    ll limit = n;

    for(int i = 0; i < m; i++) {
        cin >> v[i].F >> v[i].S;
    }
    n -= v[0].F;

    for(int i = 0; i < m; i++) {
      //  n -= v[i].F;
        if(n <= 0) {
            break;
        }
        if(n >= limit)
            n = limit;
        if(n != limit)
            n += (v[i].S - v[i].F);
        if(n >= limit)
            n = limit;
        if(i < m - 1)
            n -= (v[i + 1].F - v[i].S);

        if(n <= 0) {
            break;
        }
    }
   // cout << n;
    n -= (t - v[m - 1].S);
    if(n <= 0) {
        cout << "No";
    }
    else {
        cout << "Yes";
    }
    return 0;
}
