#include<stdio.h>

void quick_sort(int s[], int l, int r)
{
    if(l < r)
    {
        int i = l, j = r, x = s[l];
        while(i < j)
        {
            while(i < j && s[j] >= x)
                j--;
            if(i < j)
                s[i++] = s[j];

            while(i < j && s[i] < x)
                i++;
            if(i < j)
                s[j--] = s[i];
        }
        s[i] = x;
        quick_sort(s, l, i - 1);
        quick_sort(s, i + 1, r);
    }
}

    int main(void)
{
    int n;
    long m, sum = 0;
    _Bool flag = 1;
    scanf("%d%ld", &n, &m);

    int t[n];
    for (int i = 0; i < n; i++)
        scanf("%d", &t[i]);
    quick_sort(t, 0, n);

    for (int i = 0; i < n; i++)
    {
        sum = sum +((n - i) * t[i]);
        if(sum > m)
        {
            flag = 0;
            break;
        }
    }

    if(flag == 0)
        printf("No");
    else
        printf("Yes");

    return 0;
}