#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 / 20LL;
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;
}

template <class _T> void tp_getPrimes(_T targ, std::map<_T, _T>& primes)
{
	_T target = targ;
	_T i = 2;
	while ((i * i) <= target) {
		if ((target % i) == 0) {
			target /= i;
			primes[i]++;
		}
		else {
			i++;
		}
	}
	if (target > 1) {
		primes[target]++;
	}
}


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

	std::vector<LLONG> ai(N);
	std::vector<std::map<int, int>> prms;
	for (int i = 0; i < N; i++) {
		get(ai[i]);
		std::map<int, int> pr;
		tp_getPrimes<int>(ai[i], pr);
		prms.push_back(pr);
	}
	
	std::set<LLONG> ans;
	std::set<std::set<std::map<int, int>>> ps;
	for (int k = 0; k < (1 << N); k++) {
		std::bitset<32> bs(k);
		if (bs.count() < K) continue;

		LLONG sum = 0, mul = 1;
		std::set<std::map<int, int>> pset;
		for (int i = 0; i < N; i++) {
			if (k & (1 << i)) {
				sum += ai[i];
				mul *= ai[i];
				if (mul >= 100000) {
					mul = 100000;
				}
				pset.insert(prms[i]);
			}
		}

		ans.insert(sum);
		if (mul >= 100000) {
			ps.insert(pset);
		}
		else {
			ans.insert(mul);
		}
	}
	printf("%d\n", (int)(ans.size() + ps.size()));
}