#include "bits/stdc++.h"
//#define int long long
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = (1LL << 61);
ll mod = 1000000007;
map<ll, ll> prime_factor(ll n) {
	map<ll, ll> ret;
	for (ll i = 2; i * i <= n; i++) {
		while (n % i == 0) {
			ret[i]++;
			n /= i;
		}
	}
	if (n != 1) ret[n] = 1;
	return ret;
}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	ll N, K; cin >> N >> K;
	vector<ll>A(N); for (int i = 0; i < N; i++)cin >> A[i];
	map<map<ll, ll>, bool>mp;
	for (ll bit = 0; bit < (1LL << N); bit++) {
		int cnt = 0;
		for (ll i = 0; i < N; i++) {
			if (bit >> i & 1) {
				cnt++;
			}
		}
		if (cnt < K)continue;
		ll sum = 0;
		for (int i = 0; i < N; i++) {
			if (bit >> i & 1) {
				sum += A[i];
			}
		}
		auto p = prime_factor(sum);
		mp[p] = true;
		map<ll, ll>tmp;
		for (int i = 0; i < N; i++) {
			if (bit >> i & 1) {
				auto x = prime_factor(A[i]);
				for (auto y : x) {
					tmp[y.first] += y.second;
				}
			}
		}
		mp[tmp] = true;
	}
	cout << mp.size() << endl;
	return 0;
}