import java.util.Arrays;
import java.util.Scanner;

public class Main{

	public static void main(String args[]){
		Scanner scan = new Scanner(System.in);
		int N = scan.nextInt();
		int M = scan.nextInt();
		int[] A = new int[N];
		int sum = 0;
		for(int i=0;i<N;i++) {
			A[i] = scan.nextInt();
			sum += A[i];
		}
		int judge = sum/(4*M);
		boolean judgeF = true;
		if(sum%(4*M)>0) {
			judgeF = false;
		}
		Arrays.sort(A);
		String result = "Yes";
		int count = 0;

		for(int j=N-1;count<M;j--) {
			if(judgeF){
				if(A[j]<judge) {
					result = "No";
				}
			}else {
				if(A[j]<=judge) {
					result = "No";
				}
			}
			count++;
		}

		System.out.println(result);

	}
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz