#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3fll;
vector<pair<long long, int> > V1, V2, V;
long long sum;
int times;
long long fac[25];
long long a[25];
int k;
long long S;
void dfs(int x, int lim) {
  if (x == lim) {
    if (times <= k) V.push_back(make_pair(sum, times));
    return;
  }
  dfs(x + 1, lim);
  if (sum + a[x] <= S) {
    sum += a[x];
    dfs(x + 1, lim);
    sum -= a[x];
  }
  if (times < k && fac[x] != -1 && sum + fac[x] <= S) {
    sum += fac[x];
    times++;
    dfs(x + 1, lim);
    sum -= fac[x];
    times--;
  }
}
int main() {
  int n;
  cin >> n >> k >> S;
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < n; i++) {
    if (a[i] >= 19) {
      fac[i] = -1;
    } else {
      fac[i] = 1;
      for (int j = 1; j <= a[i]; j++) fac[i] = fac[i] * j;
    }
  }
  int half = n / 2;
  V.clear();
  dfs(0, half);
  sort(V.begin(), V.end());
  V1 = V;
  V.clear();
  dfs(half, n);
  sort(V.begin(), V.end());
  V2 = V;
  long long ans = 0;
  int sz1 = V1.size(), sz2 = V2.size();
  for (int i = 0; i < sz1; i++) {
    long long t = S - V1[i].first;
    int pos =
        lower_bound(V2.begin(), V2.end(), make_pair(t, -inf)) - V2.begin();
    int pos2 =
        upper_bound(V2.begin(), V2.end(), make_pair(t, k - V1[i].second)) -
        V2.begin();
    ans += pos2 - pos;
  }
  cout << ans << endl;
  return 0;
}
