import java.util.Scanner;publicclassP1036{privatestaticint n;privatestaticint k;privatestaticint num;privatestaticint count;privatestaticint[] arrayList;publicstaticvoidmain(String[] args){
Scanner sc =newScanner(System.in);
n = sc.nextInt();
k = sc.nextInt();if(n >=1&& n <=20&& k < n){
arrayList =newint[n];for(int i =0; i < n; i++)
arrayList[i]= sc.nextInt();}doSearch(1,-1);
System.out.println(count);}staticvoiddoSearch(int x,int y){if(x > k){if(isPrime(num))
count++;return;}for(int i = y +1; i < n; i++){//找数
num += arrayList[i];doSearch(x +1, i);//回溯
num -= arrayList[i];}}privatestaticbooleanisPrime(int num){if(num <=1|| Math.sqrt(num)==(int) Math.sqrt(num))returnfalse;for(int i =2; i < Math.sqrt(num); i++){if(num % i ==0)returnfalse;}returntrue;}}