#include <algorithm>
#include <iostream>
#include <stack>
#include <queue>
#include <math.h>
#include <cmath>
#include <string>
#include <string.h>
#include <iterator>
#include <map>
#include <set>
#include <iomanip>
#include <vector>
#include <cstdint>
#include <time.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
#define rep(i, N) for (int i = 0; i < N; i++)
#define rep2(i, l, r) for (ll i = (ll)l; i < (ll)(r); i++)
#define INF 1000000000
#define MAX 200001
#define PI 3.141592653589793

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
const ll MOD = 1000000007;

/*clock_t start = clock();
clock_t end = clock();
const double time = static_cast<double>(end - start) / CLOCKS_PER_SEC * 1000.0;
printf("%lf", time);*/

template <typename T > inline string toString(const T &a) {ostringstream oss; oss << a; return oss.str();};

int main(){
    int N,M,T;
    cin >> N >> M >> T;
    int MAX_N = N;
    int now = 0;
    rep(i,M){
        int A,B;
        cin >> A >> B;
        N -= A-now;
        if(N <= 0){
            cout << "No" << endl;
            return 0;
        }
        N += B-A;
        N = min(MAX_N,N);
        now = B;
        if(i == M-1 && N <= T-B){
            cout << "No" << endl;
            return 0;
        }
    }
    cout << "Yes" << endl;
}
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main() {
	int n,m,t;
	cin>>n>>m>>t;
	int prev_t = 0;
	int curr = n;
	for(int i=0;i<m;i++){
		int a, b;
		cin>>a>>b;
		curr = max(curr-(a-prev_t)*1,0);
		if(curr==0){
			cout<<"No"<<endl;
			return 0;
		}
		curr = min(curr+(b-a)*1, n );
		prev_t = b;
	}
	curr = curr - (t-prev_t)*1;
	if(curr>0) cout<<"Yes";
	else cout<<"No";

    return 0;
    
}