#include<bits/stdc++.h>
using namespace std;
int v[10001], n, k;
bool hash1[10001];

bool isprime(int num) {
    if (num <= 1) return false;
    if (num == 2) return true;
    if (num % 2 == 0) return false;
    int sqrt_num = static_cast<int>(sqrt(num));
    for (int i = 3; i <= sqrt_num; i += 2) { 
        if (num % i == 0) return false;
    }
    return true;
}

void dfs(int i, int sum, int remaining_k) {
    if (remaining_k == 0) {
        if (isprime(sum)) {
            hash1[sum] = true;
        }
        return;
    }
    if (i > n) return;
    dfs(i + 1, sum + v[i], remaining_k - 1);
    dfs(i + 1, sum, remaining_k);
}

int main() {
    cin >> n >> k;
    for (int i = 1; i <= n; i++) {
        cin >> v[i];
    }
    dfs(1, 0, k);
    int ans = 0;
    for (int i = 1; i < 10001; i++) {
        if (hash1[i]) ans++;
    }
    cout << ans;
}