#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

using namespace std;
using ll = long long;

int main() {
  int n, m, t;
  cin >> n >> m >> t;
  int lt = 0;
  int battery = n;
  bool ok = true;
  rep(i, m) {
    int a, b;
    cin >> a >> b;
    battery -= a - lt;
    if (battery <= 0) {
      ok = false;
    }
    battery += b - a;
    if (n < battery) {
      battery = n;
    }
    lt = b;
  }
  battery -= t - lt;
  if (battery <= 0) {
    ok = false;
  }
  if (ok) {
    cout << "Yes" << endl;
  } else {
    cout << "No" << endl;
  }
  return 0;
}
 #include <iostream>
    using namespace std;
    long long s[1006], e[1006];
    int main() {
    	long long n, m, t;
    	cin >> n >> m >> t;
    	for (int i=0; i<m; i++) {
    		cin >> s[i] >> e[i];
    	}
    	long long count;
        count=n;
    	count-=s[0];
    	for (int i=0; i<m; i++) {
     		if (count<=0) {
    			cout << "No" << endl;
    			return 0;
    		}
    		count+=e[i]-s[i];
    		if (count>n) {
    			count=n;
    		}
    		if (i==m-1) {
    			continue;
    		}
    		count-=(s[i+1]-e[i]);
    	}
    	count-=t-e[m-1];
    	if (count<=0) {
    		cout << "No" << endl;
    	}
    	else {
    		cout << "Yes" << endl;
    	}
return 0;
    }