#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}void pr(){ln;}
template<class A,class...B>void pr(const A &a,const B&...b){cout<<a<<(sizeof...(b)?" ":"");pr(b...);}
template<class A>void PR(A a,ll n){rep(i,n)cout<<(i?" ":"")<<a[i];ln;}
const ll MAX=1e9+7,MAXL=1LL<<61,dx[8]={-1,0,1,0,-1,-1,1,1},dy[8]={0,1,0,-1,-1,1,1,-1};
typedef pair<ll,ll> P;

vector<P> calc(ll n) {
  vector<P> v;
  for(ll i=2; i*i<=n; i++) {
    P p=P(i,0);
    while(n%i==0) {
      n/=i;
      p.S++;
    }
    if(p.S) v.pb(p);
  }
  if(n>1) v.pb(P(n,1));
  sort(all(v));
  return v;
}

void Main() {
  ll n,m;
  cin >> n >> m;
  ll a[n];
  rep(i,n) cin >> a[i];
  vector<P> v[n];
  rep(i,n) v[i]=calc(a[i]);
  set<vector<P> > s;
  REP(t,1,1<<n) {
    if(__builtin_popcount(t)<m) continue;
    map<ll,ll> ma;
    ll sum=0;
    rep(i,n) {
      if(t&(1<<i)) {
        rep(j,v[i].size()) ma[v[i][j].F]+=v[i][j].S;
        sum+=a[i];
      }
    }
    vector<P> b;
    tr(it,ma) b.pb(P(it->F,it->S));
    s.in(b);
    s.in(calc(sum));
  }
  pr(s.size());
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}