#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
 
#define all(x)                      (x).begin(),(x).end()
#define Sort(x)                     sort(all((x)))
#define X                           first
#define Y                           second
#define sep                         ' '
#define endl                        '\n'
#define sz(x)                       (int)(x.size())
#define debug(x)                    cerr << #x << ": " <<  x << endl;
#define bug(x)                      cerr << #x << ": " <<  x <<  " ";
#define alog(a, n)                  for (int i = 0; i < n; i++) cout << a[i] << " "; cout << endl;
#define FOR(n)                      for (int i = 0; i < n; i++)
#define fast_io                     ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
 
ll poww(ll a, ll b, ll md) {
    if (b == -1) return poww(a, md - 2, md);
    return (!b ? 1 : (b & 1 ? a * poww(a * a % md, b / 2, md) % md : poww(a * a % md, b / 2, md) % md));
}
 
const ll N = 1e6 + 10;
const ll LOG = 22;
const ll INF = 8e18;
const ll MOD = 1e9 + 7; // 998244353; // 1e9 + 9;

int n, m, t;
int c[N][2];

int main(){
    fast_io
    cin >> n >> m >> t;

    for(int i = 0; i < m; i++)
        cin >> c[i][0] >> c[i][1];

    int ch = n, lst = 0;

    for(int i = 0; i < m; i++){
        if(c[i][0] - lst >= ch)
            return cout << "No" << endl, 0;
        ch -= c[i][0] - lst;
        ch = min(n, ch + c[i][1] - c[i][0]); lst = c[i][1];
    }

    if(t - c[m - 1][1] >= ch)
        return cout << "No" << endl, 0;

    cout << "Yes" << endl; return 0;

}

#include"bits/stdc++.h"
//#include"atcoder.h"
#include<iostream>
using namespace std;
typedef long long ll;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
const ll inf = ll(1e18) + 1;
const ll mod = 1000000007;



int main() {

    ll n,m,t;
    cin >> n >> m >> t;

    vector<ll>a(m);
    vector<ll>b(m);
    rep(i,m) {
        cin >> a[i] >> b[i];
    }

    ll now = 0;
    ll ma = n;

    rep(i,m) {
        n -= a[i] - now;

        if (n <= 0) {
            cout << "No" << endl;
            return 0;
        }

        n += b[i] - a[i];

        if (n > ma) {
            n = ma;
        }
        now = b[i];
    }

    if (n > t-now) {
        cout << "Yes" << endl;
    }
    else {
        cout << "No" << endl;
    }
    return 0;
}