#include<stdio.h>
#include<stdlib.h>
int cmpfunc(const void*a,const void*b)
{
    if((*(int*)a - *(int*)b)>0)
    {
        return -1;
    }
    if((*(int*)a - *(int*)b)<0)
    {
        return 1;
    }
    if(*(int*)a == *(int*)b)
    {
        return 0;
    }
    
}
int main(void)
{
    int n,m,a[100],sum=0,count=0;
    scanf("%d%d",&n,&m);
    for(int i=0;i<n;i++)
    {
        scanf("%d",&a[i]);
        sum = sum + a[i];
    }
    qsort(a,n,sizeof(a[0]),cmpfunc);
    int judge = sum/(4*m);
    for(int i=0;i<n;i++)
    {
        if(a[i]>=judge)
        {
            count++;
        }
    }
    if(m<=count)
    {
        printf("Yes");
    }
    else
    {
        printf("No");
    }
    
    
}