#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
template <class T>
inline bool read(T &n) {
  T x = 0, tmp = 1;
  char c = getchar();
  while ((c < '0' || c > '9') && c != '-' && c != EOF) c = getchar();
  if (c == EOF) return false;
  if (c == '-') c = getchar(), tmp = -1;
  while (c >= '0' && c <= '9') x *= 10, x += (c - '0'), c = getchar();
  n = x * tmp;
  return true;
}
template <class T>
inline void write(T n) {
  if (n < 0) {
    putchar('-');
    n = -n;
  }
  int len = 0, data[20];
  while (n) {
    data[len++] = n % 10;
    n /= 10;
  }
  if (!len) data[len++] = 0;
  while (len--) putchar(data[len] + 48);
}
long long f[21] = {0, 1}, s, a[26], ans;
int n, k;
map<long long, int> way[26];
void dfs(int i, long long sum, int num) {
  if (sum > s || num > k) return;
  if (i >= n / 2) {
    way[num][sum]++;
  } else {
    dfs(i + 1, sum, num);
    dfs(i + 1, sum + a[i], num);
    if (a[i] < 20) dfs(i + 1, sum + f[a[i]], num + 1);
  }
}
void dfs2(int i, long long sum, int num) {
  if (sum > s || num > k) return;
  if (i >= n) {
    for (int j = 0; j <= k - num; j++)
      if (way[j].find(s - sum) != way[j].end()) ans += way[j][s - sum];
  } else {
    dfs2(i + 1, sum, num);
    dfs2(i + 1, sum + a[i], num);
    if (a[i] < 20) dfs2(i + 1, sum + f[a[i]], num + 1);
  }
}
int main() {
  for (int i = 2; i < 20; i++) f[i] = f[i - 1] * i;
  read(n), read(k), read(s);
  for (int i = 0; i < n; i++) read(a[i]);
  dfs(0, 0, 0);
  dfs2(n / 2, 0, 0);
  write(ans), putchar('\n');
  return 0;
}
