#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void read(T& x) {
  char c;
  bool f = 0;
  while ((c = getchar()) < '0' || '9' < c) f |= (c == '-');
  for (x = (c ^ 48); '0' <= (c = getchar()) && c <= '9';
       x = (x << 1) + (x << 3) + (c ^ 48))
    ;
  if (f) x = -x;
}
template <class T>
inline T read(const T sample) {
  T x = 0;
  char c;
  bool f = 0;
  while ((c = getchar()) < '0' || '9' < c) f |= (c == '-');
  for (x = (c ^ 48); '0' <= (c = getchar()) && c <= '9';
       x = (x << 1) + (x << 3) + (c ^ 48))
    ;
  return f ? -x : x;
}
template <class T>
void fwrit(const T x) {
  if (x < 0) return (void)(putchar('-'), fwrit(-x));
  if (x > 9) fwrit(x / 10);
  putchar(x % 10 ^ 48);
}
template <class T>
inline T Max(const T x, const T y) {
  return x > y ? x : y;
}
template <class T>
inline T Min(const T x, const T y) {
  return x < y ? x : y;
}
template <class T>
inline T fab(const T x) {
  return x > 0 ? x : -x;
}
inline int gcd(const int a, const int b) { return b ? gcd(b, a % b) : a; }
inline void getInv(int inv[], const int lim, const int MOD) {
  inv[0] = inv[1] = 1;
  for (int i = 2; i <= lim; ++i)
    inv[i] = 1ll * inv[MOD % i] * (MOD - MOD / i) % MOD;
}
inline long long mulMod(const long long a, const long long b,
                        const long long mod) {
  return ((a * b - (long long)((long double)a / mod * b + 1e-8) * mod) % mod +
          mod) %
         mod;
}
const int maxn = 100;
int n, r;
struct node {
  int a, b;
} up[maxn + 5], down[maxn + 5];
int ucnt, dcnt;
inline bool cmp1(const node x, const node y) {
  if (x.a == y.a) return x.b > y.b;
  return x.a < y.a;
}
inline void Init() {
  n = read(1), r = read(1);
  int x, y;
  for (signed i = (1), i_end_ = (n); i <= i_end_; ++i) {
    x = read(1), y = read(1);
    if (y < 0)
      down[++dcnt] = node{x, y};
    else
      up[++ucnt] = node{x, y};
  }
}
int ans;
inline void Get_up() {
  sort(up + 1, up + ucnt + 1, cmp1);
  for (signed i = (1), i_end_ = (ucnt); i <= i_end_; ++i)
    if (r >= up[i].a)
      r += up[i].b, ++ans;
    else
      break;
}
int f[maxn + 5][maxn + 5];
inline bool cmp2(const node x, const node y) { return x.a + x.b >= y.a + y.b; }
inline void Get_f() {
  sort(down + 1, down + dcnt + 1, cmp2);
  memset(f, -0x3f, sizeof f);
  f[0][0] = r;
  for (signed i = (1), i_end_ = (dcnt); i <= i_end_; ++i)
    for (signed j = (0), j_end_ = (i); j <= j_end_; ++j) {
      f[i][j] = f[i - 1][j];
      if (j > 0 && f[i - 1][j - 1] >= down[i].a)
        f[i][j] = Max(f[i][j], f[i - 1][j - 1] + down[i].b);
    }
  for (signed j = (dcnt), j_end_ = (0); j >= j_end_; --j)
    if (f[dcnt][j] >= 0) {
      ans += j;
      break;
    }
  fwrit(ans), putchar('\n');
}
signed main() {
  Init();
  Get_up();
  Get_f();
  return 0;
}
