#include<bits/stdc++.h>
using namespace std;
const int N = 15 * 1e6;
int n, k;
int cina[25], res, ans, dis[N];
//
int main(){
	cin>>n>>k;
	for(int i = 1; i <= n; ++i){
		cin>>cina[i];
	}
	sort(cina + 1, cina + n);
	do{
		for(int i = 1; i <= k; ++i){
			res += cina[i];
		}
		if(dis[res] == 0){
			dis[res] = 1;
			if(res % 2 != 0){
				ans++;
			}
		}
		res = 0;
	}while(next_permutation(cina + 1, cina + n + 1));
	cout<<ans<<endl;
	return 0;
}