#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define P pair<int, int>

int main() {
  int n, k;
  cin >> n >> k;
  vector<int> a(n);
  rep(i, n) cin >> a[i];


  auto factorize = [&](map<int, int>& mp, int x) {
    for (int i = 2; i*i <= x; i++) {
      if (x%i==0) {
        while(x%i==0) {
          mp[i]++;
          x /= i;
        }
      }
    }
    if (x > 1) mp[x]++;
  };

  set<map<int,int>> s;
  rep(bit, 1<<n) {
    int cnt = 0;
    int sum = 0;
    map<int, int> mp_sum, mp_prod;
    rep(j, n) {
      if (bit>>j&1) {
        cnt++;
        sum += a[j];
        factorize(mp_prod, a[j]);
      }
    }
    if (cnt < k) continue;
    factorize(mp_sum, sum);
    s.insert(mp_sum);
    s.insert(mp_prod);
  }
  cout << s.size() << endl;

}