#include <bits/stdc++.h>
using namespace std;
const int dir[4][2] = {1, 0, 0, 1, -1, 0, 0, -1};
const int N = 1e6 + 10;
const int mod = 1e9 + 7;
const double pi = acos(-1);
const int INF = 0x3f3f3f3f;
int a[N];
int n, s, K;
int main() {
  ios::sync_with_stdio(0);
  cin >> n >> s;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
  }
  sort(a + 1, a + 1 + n);
  long long sum = 0;
  for (int i = 1; i < n; ++i) {
    if (sum + a[i] <= s) {
      sum += a[i];
    } else {
      return puts("NO"), 0;
    }
  }
  puts("YES");
  return 0;
}
