#include "bits/stdc++.h"
#include <boost/multiprecision/cpp_int.hpp>

#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define debug_print(var) cerr << #var << "=" << var <<endl;
#define DUMP(i, v)for(ll i=0;i<v.size();i++)cerr<<v[i]<<" "
#define fi first
#define se second

using namespace std;
typedef long long int ll;
typedef vector<ll> llvec;
typedef vector<double> dvec;
typedef pair<ll, ll> P;
typedef long double ld;
struct edge{ll x, c;};

using cpp_int = boost::multiprecision::cpp_int;

/**************************************
** A main function starts from here  **
***************************************/
int main(){
  ll N, K;
  cin >> N >> K;
  vector<cpp_int> A(N);
  rep(i, N)cin >> A[i];

  set<cpp_int> s;
  rep(i, 1<<N){
    cpp_int tmp = 1;
    cpp_int tmp2 = 0;
    ll cnt = 0;
    rep(k, N){
      if(i>>k&1){
        cnt++;
        tmp = tmp*A[k];
        tmp2 = tmp2 + A[k];
      }
    }
    if(cnt>=K){
      s.insert(tmp);
      s.insert(tmp2);
    }
  }
  cout << s.size()<<endl;
  return 0;
}