#include <bits/stdc++.h>
#include <atcoder/all>

typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 1000000007LL; //998244353LL;
static const LLONG INF_NUM = LLONG_MAX;
template<class _T> static void get(_T& a) {
	std::cin >> a;
}
template<class _T> static void get(_T& a, _T& b) {
	std::cin >> a >> b;
}
template<class _T> static void get(_T& a, _T& b, _T& c) {
	std::cin >> a >> b >> c;
}
template <class _T> static _T tp_abs(_T a) {
	if (a < (_T)0) {
		a *= (_T)-1;
	}
	return a;
}

static void task();

int main()
{
	task();
	fflush(stdout);
	return 0;
}

static void task()
{
	int N, K;
	get(N, K);

	std::vector<LLONG> ai(N);
	for (int i = 0; i < N; i++) {
		get(ai[i]);
	}
	std::multiset<int> ms;

	std::set<LLONG> ans;
	std::set<std::set<LLONG>> multiply;
	for (int select = 0; select < (1 << N); select++) {
		std::bitset<32> bs(select);
		if (bs.count() < K) continue;

		std::vector<LLONG> selected;
		for (int i = 0; i < N; i++) {
			if (select & (1 << i)) {
				selected.push_back(ai[i]);
			}
		}

		LLONG sum = 0, mul = 1;
		std::set<LLONG> elem;
		for (auto s : selected) {
			sum += s;
			if (s != 1) {
				elem.insert(s);
			}
			mul *= s;
			if (mul > (1000LL * N)) {
				mul = MOD_NUM;
			}
		}

		ans.insert(sum);
		if (mul == MOD_NUM) {
			multiply.insert(elem);
		}
		else {
			ans.insert(mul);
		}
	}
	printf("%d\n", (int)ans.size() + (int)multiply.size());
}