def issu(x):
if x<=1:
return False
m=int(x**0.5)
for i in range(2,m+1):
if x%i==0:
return False
return True
def dfs(defth,path,list1):
if defth==k:
if issu(sum(path)):
global ans
ans+=1
print(ans)
return
for i in list1:
path[defth]=i
dfs(defth+1,path,list1)
n,k=map(int,input().split())
list1=map(int,input().split())
path=[0]*3
ans=0
dfs(0,path,list1)
