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

int main(){
  int n, k; cin >> n >> k;
  vector<ll> a(n);
  set<ll> st;
  for(int i = 0; i < n; i++) cin >> a[i];
  for(int bit = 0; bit < (1<<n); bit++){
    ll sum = 0;
    ll pro = 1;
    if(__builtin_popcount (bit)<k) continue; 
    for(int j = 0; j < n; j++){
      if(bit&(1<<j)){
        sum += a[j];
        pro *= a[j];
      }
    }
    st.insert(sum);
    st.insert(pro);
  }
  cout << st.size() << endl;
  return 0;
}