#include <bits/stdc++.h>
using namespace std;
long long modulo(long long base, long long exponent, long long modulus);
long long choose(long long n, long long k);
long long inverse(long long a, long long m);
void build();
long long ncr(long long n, long long r);
const int nax = 1e6 + 10;
const int LG = log2(nax) + 1;
vector<long long> fact(nax);
bool comp(pair<long long, long long> a, pair<long long, long long> b) {
  if (a.second + a.first == b.second + b.first) return a.first < b.first;
  return a.second + a.first > b.second + b.first;
}
long long dp[105][60009];
long long dpsolve(long long ind, long long r,
                  vector<pair<long long, long long> > &b) {
  if (ind == b.size()) {
    return 0;
  }
  if (r < 0) return 0;
  if (dp[ind][r] != -1) return dp[ind][r];
  long long &ans = dp[ind][r];
  ans = dpsolve(ind + 1, r, b);
  if (b[ind].first <= r)
    ans = max(ans, dpsolve(ind + 1, r + b[ind].second, b) + 1);
  return ans;
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n, r;
  cin >> n >> r;
  vector<pair<long long, long long> > a, b;
  for (int i = 0; i < n; i++) {
    long long x, y;
    cin >> x >> y;
    if (y >= 0) {
      a.push_back({x, y});
    } else {
      b.push_back({x, y});
    }
  }
  long long ans = 0;
  sort(a.begin(), a.end());
  for (int i = 0; i < a.size(); i++) {
    if (a[i].first <= r) {
      r += a[i].second;
      ans++;
    }
  }
  for (int i = 0; i < b.size(); i++) {
    b[i].first = max(b[i].first, -b[i].second);
  }
  sort(b.begin(), b.end(), comp);
  memset(dp, -1, sizeof(dp));
  if (ans + dpsolve(0, r, b) == n)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
  return 0;
}
long long ncr(long long n, long long r) {
  if (r > n || r < 0 || n < 0) return 0;
  long long ans = fact[n];
  long long temp = (fact[n - r] * fact[r]) % 1000000007;
  ans = (ans * inverse(temp, 1000000007)) % 1000000007;
  return ans;
}
void build() {
  fact[0] = 1;
  for (long long i = 1; i < nax; i++) fact[i] = (fact[i - 1] * i) % 1000000007;
}
long long modulo(long long base, long long exponent, long long modulus) {
  if (modulus == 1) return 0;
  long long result = 1;
  base = base % modulus;
  while (exponent > 0) {
    if (exponent % 2 == 1) {
      result = (result * base) % modulus;
    }
    exponent = exponent >> 1;
    base = (base * base) % modulus;
  }
  return result;
}
long long choose(long long n, long long k) {
  if (k == 0) return 1;
  return (n * choose(n - 1, k - 1)) / k;
}
void EE(long long a, long long b, long long &co1, long long &co2) {
  if (a % b == 0) {
    co1 = 0;
    co2 = 1;
    return;
  }
  EE(b, a % b, co1, co2);
  long long temp = co1;
  co1 = co2;
  co2 = temp - co2 * (a / b);
}
long long inverse(long long a, long long m) {
  long long x, y;
  EE(a, m, x, y);
  if (x < 0) x += m;
  return x;
}
