#include <stdio.h>
#include <stdlib.h>

int		cmpnum(const void *n1, const void *n2)
{
	if (*(int *)n1 < *(int *)n2)
		return (1);
	if (*(int *)n1 > *(int *)n2)
		return (-1);
	else
		return (0);
}

int		main()
{
	int		N, M, i = 0;
	int		sum;
	double	val;
	int		*A;

	sum = 0;
	scanf("%d %d\n", &N, &M);
	A = (int *)calloc((N + 1), sizeof(int));
	while (i < N)
	{
		scanf("%d \n", &A[i]);
		sum += A[i];
		i++;
	}
	qsort(A, N, sizeof(int), cmpnum);
	i = 0;
	val = (double)sum / (4 * (double)M);
	while (i < M)
	{
		if ((double)A[i] < val)
		{
			printf("No\n");
			return (0);
		}
		i++;
	}
	printf("Yes\n");
	return (0);
}
