#include <bits/stdc++.h>
int cmp(const void *v1, const void *v2) { return *(int *)v1 - *(int *)v2; }
int n, m, i, j, k, sum, d, t[101], tmp1, tmp2, max, min, ans, x, s;
int main() {
  scanf("%d%d", &n, &s);
  min = s + 1;
  for (i = 0; i < n; i++) {
    scanf("%d", &t[i]);
  }
  qsort(t, n, 4, cmp);
  for (i = 0; i < n - 1; i++) {
    sum += t[i];
  }
  printf("%s\n", sum <= s ? "YES" : "NO");
  return 0;
}
