#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<vl> vvl;

double EPS=1e-9;
int INF=1000000005;
long long INFF=1000000000000000005ll;
double PI=acos(-1);
int dirx[8]={ -1, 0, 0, 1, -1, -1, 1, 1 };
int diry[8]={ 0, 1, -1, 0, -1, 1, -1, 1 };
const ll MOD = 1000000007;

ll sum() { return 0; }
template<typename T, typename... Args>
T sum(T a, Args... args) { return a + sum(args...); }

#define DEBUG fprintf(stderr, "====TESTING====\n")
#define VALUE(x) cerr << "The value of " << #x << " is " << x << endl
#define OUT(x) cout << x << endl
#define OUTH(x) cout << x << " "
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define READ(x) for(auto &(z):x) cin >> z;
#define FOR(a, b, c) for (int(a)=(b); (a) < (c); ++(a))
#define FORN(a, b, c) for (int(a)=(b); (a) <= (c); ++(a))
#define FORD(a, b, c) for (int(a)=(b); (a) >= (c); --(a))
#define FORSQ(a, b, c) for (int(a)=(b); (a) * (a) <= (c); ++(a))
#define FORC(a, b, c) for (char(a)=(b); (a) <= (c); ++(a))
#define EACH(a, b) for (auto&(a) : (b))
#define REP(i, n) FOR(i, 0, n)
#define REPN(i, n) FORN(i, 1, n)
#define MAX(a, b) a=max(a, b)
#define MIN(a, b) a=min(a, b)
#define SQR(x) ((ll)(x) * (x))
#define RESET(a, b) memset(a, b, sizeof(a))
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ALL(v) v.begin(), v.end()
#define ALLA(arr, sz) arr, arr + sz
#define SIZE(v) (int)v.size()
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define SORTA(arr, sz) sort(ALLA(arr, sz))
#define REVERSEA(arr, sz) reverse(ALLA(arr, sz))
#define PERMUTE next_permutation
#define TC(t) while (t--)
#define FAST_INP  ios_base::sync_with_stdio(false);cin.tie(NULL)
#define what_is(x) cerr << #x << " is " << x << endl;

void solve() {

}

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

//    int tc; cin >> tc;
//    TC(tc) solve();
	int n, m, t;
	cin >> n >> m >> t;
	vi a(m), b(m);
	REP(i, m) cin >> a[i] >> b[i];
	int left = n;
	left -= a[0];
	if(left <= 0) {
		OUT("No");
		return 0;
	}
	left += (b[0] - a[0]);
	MIN(left, n);
	FOR(i, 1, m ) {
		left -= (a[i] - b[i - 1]);
		if(left <= 0) {
			OUT("No");
			return 0;
		}
		left += (b[i] - a[i]);
		MIN(left, n);
	}
	left -= (t - b[m - 1]);
	if(left <= 0) {
		OUT("No");
		return 0;
	}
	OUT("Yes");
    return 0;
}
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long
#define all(x) x.begin(),x.end()
#define MOD 1000000007
#define PI acos(-1)
#define EPS 1e-9
#define debug cerr <<
#define var(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define close << "\n";

int total_n(double start,double end){
    return (end - start + 1);
}

int main() {
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("../input.txt","r",stdin);
    int N,M,T;
    cin >> N >> M >> T;
    int maxx = N;
    int last = 0;
    for (int i = 0; i < M; ++i) {
        int a,b;
        cin >> a >> b;
        if(i!=0){
            N = max(0,N - total_n(last,a) + 1);
            if(N == 0){
                cout << "No" close
                return 0;
            }
        }

        if(i == 0){
            N = max(0,N - total_n(0,a) + 1);
            if(N == 0){
                cout << "No" close
                return 0;
            }
        }

        N = min(maxx,N + total_n(a,b) - 1);
        if(N == 0){
            cout << "No" close
            return 0;
        }

        last = b;
    }


    N = max(0,N - total_n(last,T) + 1);
    if(N == 0){
        cout << "No" close
        return 0;
    }

    if(N == 0){
        cout << "No" close
        return 0;
    }else{
        cout << "Yes" close
        return 0;
    }

}