#include <bits/stdc++.h>
using namespace std;
#define rep(i, l, n) for (int i = (int)(l); i < (int)(n); i++)
#define drep(i, n, l) for (int i = (int)(n); i > (int)(l); i--)
#define INF INT_MAX
#define INFF (pow(2,64))
#define def (200007)
#define MOD (1000000007)
typedef int64_t intt;
typedef vector<int> veci;
typedef vector<vector<int>> Veci;
typedef vector<int64_t> vecit;
typedef vector<vector<int64_t>> Vecit;
typedef vector<vector<double>> Vecd;
typedef vector<double> vecd;
typedef pair<intt, intt> P;
typedef unordered_set<int> uset;
typedef unordered_set<intt> usett;

int main(){
  intt N,M,T;cin>>N>>M>>T;
  intt rest=N;
  intt pre_date=0;
  int judge=1;
  rep(i,0,M){
    int a,b;cin>>a>>b;
    if(i==0){
      rest-=a;
    }else rest-=a-pre_date;
    if(rest<=0)judge=0;
    rest+=b-a;
    if(rest>N)rest=N;
    pre_date=b;
  }
  rest-=T-pre_date;
  if(rest<=0)judge=0;
  if(judge)cout<<"Yes"<<endl;
  else cout<<"No"<<endl;
}
#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+5;
const int inf=0x3f3f3f3f;
int a[maxn],b[maxn];
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    //freopen(".in","r",stdin);
    //freopen(".out","w",stdout);
    int sum,num,en;
    cin>>sum>>num>>en;
    int ls=0,x=sum;
    for(int i=1;i<=num;i++)
    {
    	cin>>a[i]>>b[i];
    	sum-=(a[i]-ls);
    	if(sum<=0)
    	{
    		cout<<"No"<<endl;
    		return 0;
		}
		ls=b[i];
		sum+=(b[i]-a[i]);
		sum=min(x,sum);
	}
	sum-=en-ls;
	if(sum<=0)
	{
		cout<<"No"<<endl;
		return 0;
	}
	cout<<"Yes"<<endl;
	return 0;
}
