#include <stdio.h>
#include <stdlib.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))
typedef long long ll;

int compare_int(const void *a, const void *b)
{
    return *(int *)b - *(int *)a;
}

int main(void)
{
    int ans = 0;
    int n, m, sum = 0, a[101];

    scanf("%d%d", &n, &m);
    rep(i, n)
    {
        scanf("%d", &a[i]);
        sum += a[i];
    }

    qsort(a, n, sizeof(int), compare_int);

    rep(i, m)
    {
        if (a[i] < (double)sum / 4 / m)
        {
            puts("No");
            return 0;
        }
    }

    puts("Yes");
    return 0;
}