#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <unordered_map>
#include <set>
#include <algorithm>
#include <utility>
#include <cmath>
using namespace std;

typedef long long llong;
typedef unsigned long long ullong;
// -2.1e-9 <= int <= 2.1e9
// -9.2e-18 <= long long <= 9.2e18
// 0 <= unsigned int <= 4.2e9
// 0 <= unsigned long long <= 18.4e18
// cout << fixed << setprecision(10);

int main() {
    vector<int> A(4);
    int sum = 0;
    for (auto &a: A) {
        cin >> a;
        sum += a;
    }

    for (size_t i = 0; i < A.size(); ++i) {
        int slct = A[i];
        int notSlct = sum - A[i];
        if (slct == notSlct) {
            cout << "Yes" << endl;
            return 0;
        }
        for (size_t j = 0; j < A.size(); ++j) {
            if (j == i) continue;
            slct += A[j];
            notSlct -= A[j];
            if (slct == notSlct) {
                cout << "Yes" << endl;
                return 0;
            }
            for (size_t k = 0; k < A.size(); ++k) {
                if ((k == i) || (k == j)) continue;
                slct += A[k];
                notSlct -= A[k];
                if (slct == notSlct) {
                    cout << "Yes" << endl;
                    return 0;
                }
            }
        }

    }

    cout << "No" << endl;
}

#include <bits/stdc++.h>

using namespace std;

#define int long long
#define endl '\n'
#define maxn 200010
const int MOD = 1000000007;

void solve() {
    int n, m, t;
    cin >> n >> m >> t;
    int pre = 0, bat = n;
    for (int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;

        bat -= a - pre;
        if (bat <= 0) {
            cout << "No";
            return;
        }
        bat += b - a;
        bat = min(n, bat);
        pre = b;
    }
    bat -= t - pre;
    if (bat <= 0) {
        cout << "No";
        return;
    }
    cout << "Yes";
}

int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
//    cin >> t;

    while (t--)
        solve();
    return 0;
}