#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define pb push_back
typedef long double ld;
#define fi first
#define se second
#define PI 3.14159265358979323846264338327950288419716939937510
#define mp make_pair
#define vvl vector<vector<ll>>
#define vll vector<ll>
#define vpll vector<pll>
#define vvpll vector<vpll>
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
*/

ll inf = 1e18;
ll p = 1e9 + 7;
ld eps = 1e-9;
ll power(ll x, ll y, ll p)
{
    ll res = 1;
    x = x % p;
    while (y > 0)
    {
        if (y & 1)
            res = (res * x) % p;
        y = y >> 1;
        x = (x * x) % p;
    }
    return res;
}
ll pwr(ll x, ll y)
{
    ll res = 1;
    x = x ;
    while (y > 0)
    {
        if (y & 1)
            res = (res * x) ;
        y = y >> 1;
        x = (x * x) ;
    }
    return res;
}
ll modInverse(ll n, ll p)
{
    return power(n, p - 2, p);
}
ll gcd(ll a, ll b)
{
    if (b == 0)
        return a;
    return gcd(b, a % b);

}
int main()
{
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    ll i, y, x, z, g, key,   h, n, m, a, b, c, j, k, d;
    ll t2, t3, t4, t1, t5, t6;
    string s, s2, s1;
    ll l, r;
    ll tc;
    //cin >> tc;
    tc = 1;
    ll x1, y1, x2, y2;
    while (tc--)
    {
        cin >> n;
        ll arr[n], b[n];
        for (i = 0; i < n; i++)
            cin >> arr[i];
        for (i = 0; i < n; i++)
            cin >> b[i];
        ll val = 0;
        for (i = 0; i < n; i++)
        {
            val += (arr[i] * b[i]);
        }
        if (val == 0)
            cout << "Yes";
        else
            cout << "No";



    }



    return 0;
}
#include <bits/stdc++.h>
#include <fstream>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF=2147483647;
// 9,223,372,036,854,775,807
const ll INFL = 9223372036854775807;

int main(){
    // 入力ファイル使うとき
    ll ans;
    
    ll n,m,t;
    cin >> n >>m >>t;
    vector<vector<ll>> ab(m,vector<ll>(2));
    for(int i=0;i<m;i++){
        cin >> ab[i][0] >> ab[i][1];
    }
    // m回のカフェの訪問
    ll absta = 0;
    ll chvtmp = n;
    for(int i=0;i<m;i++){
        chvtmp -= (ab[i][0] - absta);
        if(chvtmp<=0){
            cout << "No"<<endl;
            return 0;
        }
        chvtmp += (ab[i][1]-ab[i][0]);
        if(chvtmp>=n){
            chvtmp = n;
        }
        absta = ab[i][1];
    }
    if(t-ab[m-1][1] >= chvtmp){
        cout << "No" << endl;
    }
    else{
        cout << "Yes" << endl;
    }
    return 0;
}