#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for(int i = 0; i < (n); ++i)

bool solve() {
    int n, m, t;
    cin >> n >> m >> t;
    vector<int> a(m), b(m);
    int bat = n;
    int time = 0;
    rep(i, m) {
        cin >> a[i] >> b[i];
        bat -= (a[i] - time);
        if (bat <= 0) return false;
        bat = min(bat + b[i] - a[i], n);
        time = b[i];
    }
    bat -= t - time;
    if (bat <= 0) return false;
    return true;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << (solve() ? "Yes" : "No") << endl;
    return 0;
}
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#include <iostream>
#include <string>
#include <algorithm>
#include<vector>
#include<cmath>
using namespace std;

int main(){
    int n,m,t;
    string ans = "Yes";
    cin >> n >> m >> t;
    int power = n;
    int nt = 0;
    rep(i,m){
        int a,b;
        cin >> a >> b;
        power -= (a -nt);
        if(power <= 0){
            ans = "No";
            break;
        }
        //cout << power << endl;
        power = min(n,power + (b-a));
        //cout << power << endl;
        nt = b;
    }
    if(power -(t -nt) <=0){
        ans = "No";
    }
    cout << ans << endl;
}