最后测试点help！！！！！

#include <iostream>
using namespace std;
long long n,k;
long long a[1000],u[1000],x=0,sum=0,all=0;
void dfs(long long y,long long s){
    if (y>=n){
        return;
    }
    sum+=a[y];
    if (s==k){
        u[x]=sum;
        x++;
        sum-=a[y];
        return;
    }
    for (long long i=y+1;i<n;i++){
        dfs(i,s+1);
    }
    sum-=a[y];
}
int main(){
    cin>>n>>k;
    for (long long i=0;i<n;i++){
        cin>>a[i];
    }
    for (long long i=0;i<n;i++){
        dfs(i,1);
    }
    for (long long i=0;i<x;i++){
        for (long long j=2;j<u[i];j++){
        	if (u[i]%j==0){
        		all--;
        		break;
			}
		}
		all++;
    }
    cout<<all;
}