#include<stdio.h>

int num[128];

int quicksort(int left,int right)
{
	int i,j,mid;
	i=left;j=right;
	mid=num[(left+right)>>1];
	while (i<j) 
	{
		while (num[i]>mid) ++i;
		while (num[j]<mid) --j;
		if (i<=j)
		{
			int tmp;
			tmp=num[i];num[i]=num[j];num[j]=tmp;
			++i;--j;
		}
	}
	if (i<right) quicksort(i,right);
	if (j>left) quicksort(left,j);
}

main()
{
	int n,m,i;
	int stan;
	scanf("%d%d",&n,&m);
	int sum=0; 
	for (i=1;i<=n;i++) 
	{
		scanf("%d",&num[i]);
		sum+=num[i];
	}
	stan=sum/(4*m);
	quicksort(1,n);
	int count=0;
	for (i=1;i<=n;i++)
		if (num[i]>stan) ++count;
	if (count>=m) printf("Yes");
	else printf("No");
	return 0;
}