#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<int, int>;
using PL = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define ALL(a)  (a).begin(),(a).end()
constexpr int MOD = 1000000007;
constexpr lint B1 = 1532834020;
constexpr lint M1 = 2147482409;
constexpr lint B2 = 1388622299;
constexpr lint M2 = 2147478017;
constexpr int INF = 2147483647;
void yes(bool expr) {cout << (expr ? "YES" : "NO") << "\n";}
template<class T>void chmax(T &a, const T &b) { if (a<b) a=b; }
template<class T>void chmin(T &a, const T &b) { if (b<a) a=b; }
int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  lint N, K;
  cin >> N >> K;
  vector<lint> A(N);
  REP(i, N) cin >> A[i];
  set<vector<lint>> st;
  REP(bit, 1<<N) {
    int cnt = 0;
    REP(i, N) if(bit>>i&1) cnt++;
    if(cnt < K) continue;
    lint sum = 0;
    vector<lint> vec(6);
    vec[0] = 1;
    REP(i, N) {
      if(bit>>i&1) {
        sum += A[i];
        REP(j, 6) vec[j] *= A[i];
        IREP(j, 5) if(vec[j] > 1000000000) {
          vec[j+1] += vec[j] / 1000000000;
          vec[j] %= 1000000000;
        }
      }
    }
    st.insert({sum,0,0,0,0,0});
    st.insert(vec);
  }
  cout << st.size() << endl;
}