#include <bits/stdc++.h>
using namespace std;
const long long mod = (long long)1e9 + 7;
const int inf = 1e9 + 7;
const long long infL = 1e18;
int setbit(int n, int pos) { return n = n | (1 << pos); }
int resetbit(int n, int pos) { return n = n & ~(1 << pos); }
bool checkbit(int n, int pos) { return (bool)(n & (1 << pos)); }
template <typename T>
T mul(T x, T y) {
  x %= mod;
  y %= mod;
  return (x * y) % mod;
}
template <typename T>
T add(T x, T y) {
  x %= mod;
  y %= mod;
  return (x + y) % mod;
}
template <typename T>
T modPow(T x, T k, T mod) {
  if (k == 0) return 1;
  if (k & 1) {
    return ((x % mod) * modPow(x, k - 1, mod) % mod) % mod;
  } else {
    T ret = modPow(x, k / 2, mod);
    ret %= mod;
    return (ret * ret) % mod;
  }
}
template <typename T>
T ext_gcd(T num1, T num2, T &X, T &Y) {
  T r2, r1, q2, q1, x2, x1, y2, y1, x, y, r;
  x2 = 1;
  y2 = 0;
  x1 = 0;
  y1 = 1;
  for (r2 = num1, r1 = num2; r1 != 0;
       y2 = y1, y1 = y, x2 = x1, x1 = x, r2 = r1, r1 = r) {
    q1 = r2 / r1;
    x = x2 - q1 * x1;
    y = y2 - q1 * y1;
    r = r2 % r1;
  }
  X = x2;
  Y = y2;
  return r2;
}
template <typename T>
void print(const T &v) {
  cerr << v << ' ';
}
template <typename T1, typename... T2>
void print(const T1 &first, const T2 &...rest) {
  print(first);
  print(rest...);
}
template <typename T>
T modInv(T x, T m = 1e9 + 7) {
  return modPow(x, m - 2, m);
}
template <typename T>
void dbg_a(T a[], int n = 10) {
  cerr << "[ ";
  for (int i = 0; i < n; i++) cerr << a[i] << ' ';
  cerr << " ]"
       << "\n";
}
template <typename F, typename S>
ostream &operator<<(ostream &os, const pair<F, S> &p) {
  return os << "[ " << p.first << ", " << p.second << " ]";
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  os << "[ ";
  for (int i = 0; i < v.size(); i++) os << v[i] << ' ';
  return os << " ]";
}
template <typename T>
ostream &operator<<(ostream &os, const set<T> &s) {
  os << "[ ";
  for (__typeof((s).begin()) it = (s).begin(); it != (s).end(); ++it)
    os << *it << ' ';
  return os << " ]";
}
template <typename T>
ostream &operator<<(ostream &os, const multiset<T> &s) {
  os << "[ ";
  for (__typeof((s).begin()) it = (s).begin(); it != (s).end(); ++it)
    os << *it << ' ';
  return os << " ]";
}
long long modAdd(long long &x, long long y) {
  x += y;
  if (x >= mod) x -= mod;
  return x;
}
const int M = (int)2000 + 33;
const int nx = 1000 + 23;
int dp[102][60123];
vector<pair<int, int> > v, pos, neg;
bool cmp(pair<int, int> x, pair<int, int> y) {
  return x.first + x.second > y.first + y.second;
}
int func(int id, int r) {
  if (r < 0) return -inf;
  if (id >= v.size()) return 0;
  int &ans = dp[id][r];
  if (ans != -1) return ans;
  ans = 0;
  ans = func(id + 1, r);
  if (r >= v[id].first) ans = max(ans, 1 + func(id + 1, r + v[id].second));
  return ans;
}
void solve() {
  int n, q, x, y, r = 0, tot = 0;
  cin >> n >> r;
  for (int _ = 0; _ < n; _++) {
    cin >> x >> y;
    if (y < 0) {
      v.push_back(make_pair(x, y));
    } else {
      pos.push_back(make_pair(x, y));
    }
  }
  sort(pos.begin(), pos.end());
  sort(v.begin(), v.end(), cmp);
  for (int i = 0; i < v.size(); i++) neg.push_back(v[i]);
  for (int i = 0; i < pos.size(); i++) {
    if (pos[i].first <= r) {
      r += pos[i].second;
      tot++;
    }
  }
  memset(dp, -1, sizeof dp);
  cout << func(0, r) + tot << "\n";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1, c = 0;
  while (t--) {
    solve();
  }
  return 0;
}
