求教大佬，全RE

#include<iostream>
#include<algorithm>
using namespace std;
int n[21],qn,alln;
int a,b;
int l;
bool quickprime(int r)
{
	if(r%2==0&&r!=2)return false;
	for(int i=3;i*i<=r;i+=2)if(!r%i)return false;
	return true;
}
int rec(int i,int j)
{
    l+=n[i];
    if(j==0)
    {
        if(i<=a)
        {
            if(quickprime(l))alln++;
            l-=n[i];
            return 0;
        }
        else
        {
            l-=n[i];
            return 0;
        }
    }
    else if(j>=a)
    {
        l-=n[i];
        return 0;
    }
	rec(i+1,j-1);
	l-=n[i];
	rec(i+1,j);
}
int main()
{
	
	cin>>a>>b;
	for(int i=1;i<=a;i++)cin>>n[i];
	sort(n+1,n+a);
	rec(1,b);
	cout<<alln;
}