#include <bits/stdc++.h>
using namespace std;
const int dr[] = {1, 0, -1, 0, 1, 1, -1, -1};
const int dc[] = {0, 1, 0, -1, 1, -1, -1, 1};
const double eps = 1e-9;
const int INF = 0x7FFFFFFF;
const long long INFLL = 0x7FFFFFFFFFFFFFFFLL;
const double pi = acos(-1);
template <class T>
T take(queue<T> &O) {
  T tmp = O.front();
  O.pop();
  return tmp;
}
template <class T>
T take(stack<T> &O) {
  T tmp = O.top();
  O.pop();
  return tmp;
}
template <class T>
T take(priority_queue<T> &O) {
  T tmp = O.top();
  O.pop();
  return tmp;
}
template <class T>
inline void getint(T &num) {
  bool neg = 0;
  num = 0;
  char c;
  while ((c = getchar_unlocked()) && (!isdigit(c) && c != '-'))
    ;
  if (c == '-') {
    neg = 1;
    c = getchar_unlocked();
  }
  do num = num * 10 + c - '0';
  while ((c = getchar_unlocked()) && isdigit(c));
  num *= (neg) ? -1 : 1;
}
template <class T>
inline bool inRange(T z, T a, T b) {
  return a <= z && z <= b;
}
void OPEN(string in = "input.txt", string out = "output.txt") {
  freopen(in.c_str(), "r", stdin);
  freopen(out.c_str(), "w", stdout);
  return;
}
map<long long, long long> sumr[25];
int n, k, num[25];
long long S, fac[20], ans;
void brut(int pos, int kleft, long long S) {
  if (S < 0) return;
  if (pos == n) {
    if (S == 0LL) ++ans;
    return;
  }
  brut(pos + 1, kleft, S - num[pos]);
  if (kleft > 0 && num[pos] <= 19) brut(pos + 1, kleft - 1, S - fac[num[pos]]);
  brut(pos + 1, kleft, S);
  return;
}
void brutSimpan(int pos, int lim, int kused, long long S) {
  if (S < 0 || kused > k) return;
  if (pos == lim) {
    if (!sumr[kused].count(S))
      sumr[kused].insert(make_pair(S, 1LL));
    else
      ++sumr[kused][S];
    return;
  }
  brutSimpan(pos + 1, lim, kused, S - num[pos]);
  if (num[pos] <= 19) brutSimpan(pos + 1, lim, kused + 1, S - fac[num[pos]]);
  brutSimpan(pos + 1, lim, kused, S);
}
void brutItung(int pos, int lim, int kused, long long S) {
  if (S < 0 || kused > k) return;
  if (pos == lim) {
    S = ::S - S;
    int upK = k - kused;
    for (int(i) = (0), _t = (upK); i <= (_t); ++(i))
      if (sumr[i].count(S)) ans += sumr[i][S];
    return;
  }
  brutItung(pos + 1, lim, kused, S - num[pos]);
  if (num[pos] <= 19) brutItung(pos + 1, lim, kused + 1, S - fac[num[pos]]);
  brutItung(pos + 1, lim, kused, S);
}
int main(int argc, const char *argv[]) {
  ios::sync_with_stdio(false);
  cin.tie(0);
  fac[0] = 1;
  for (int(i) = (1), _t = (19); i <= (_t); ++(i)) fac[i] = fac[i - 1] * i;
  cin >> n >> k >> S;
  for (int(i) = (0), _t = (n); i < (_t); ++(i)) cin >> num[i];
  if (false && n <= 10)
    brut(0, k, S);
  else {
    int mid = n / 2;
    brutSimpan(mid, n, 0, S);
    brutItung(0, mid, 0, S);
  }
  cout << ans << "\n";
  return 0;
}
