from math import sqrt

a = input().split(' ')
n = int(a[0])
k = int(a[1])
b = input().split()
c = [0] * n
for i in range(0, n):
    c[i] = int(b[i])
t = 0
m = []


def dfs(num, count, p):
    global c
    global t
    if num == k:
        kk = 0
        for g in range(2, int(sqrt(count))):
            if count / g == int(count / g):
                kk = 1
        if kk == 0:
            t += 1
    else:
        if num + n - p >= k:
            for j in range(p, n):
                dfs(num + 1, count + c[j], j + 1)


nu = 0
co = 0
dfs(nu, co, 0)
print(t)