import java.util.Scanner;
import java.util.TreeSet;

public class ShuSu {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int k = sc.nextInt();
        int[] num = new int[n];
        TreeSet<Integer> set = new TreeSet<>();
        int count = 0;
        for (int i = 0;i < num.length;i++) {
            num[i] = sc.nextInt();
        }
        sc.close();
        for (int i = 0;i < num.length;i++) {
            int a = 0;
            for (int j = 0;j <= k;j++) {
                if (j != i) {
                    a += num[j];
                }
            }
            set.add(a);
        }
        for (Integer i : set) {
            boolean flag = true;
            for (int j = 2;j < i;j++) {
                if (i % j == 0) {
                    flag = false;
                    break;
                }
            }
            if (flag) {
                count++;
            }
        }
        System.out.println(count);
    }
}