#include <iostream>
//#include<atcoder/all>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <string> 
#include <vector>
#include <algorithm>
#include <utility> 
#include <tuple> 
#include <cstdint> 
#include <cstdio> 
#include <map> 
#include <queue>
#include <set> 
#include <stack> 
#include <deque> 
#include <unordered_map> 
#include <unordered_set>
#include <bitset> 
#include <cctype>
//using namespace atcoder;
using namespace std;
using ll = long long;
#define all(A) A.begin(),A.end()
using vll = vector<ll>;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using Graph = vector<vector<vector<pair<ll, ll>>>>;

int main() {
	ll N, K;
	cin >> N >> K;
	vll A(N);
	rep(i, N) {
		cin >> A[i];
	}
	set<ll> S;
	for (int bit = 0; bit < (1 << N); ++bit) {
		ll k = 0;
		vll D;
		for (int i = 0; i < N; ++i) {
			if (bit & (1 << i)) { // 列挙に i が含まれるか
				D.push_back(A[i]);
			}
		}
		if (D.size() >= K) {
			rep(i, D.size()) {
				k += D[i];
			}
			S.insert(k);
		}
		
	}
	for (int bit = 0; bit < (1 << N); ++bit) {
		ll k = 1;
		vll D;
		for (int i = 0; i < N; ++i) {
			if (bit & (1 << i)) { // 列挙に i が含まれるか
				D.push_back(A[i]);
			}
		}
		if (D.size() >= K) {
			rep(i, D.size()) {
				k *= D[i];
			}
			S.insert(k);
		}
	}
	cout << S.size() << endl;
}