#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T _sq(T a) {
  return a * a;
}
template <class T>
inline T _sqrt(T a) {
  return (T)sqrt((double)a);
}
template <class T, class X>
inline T _pow(T a, X y) {
  T z = 1;
  for (int i = 1; i <= y; i++) {
    z *= a;
  }
  return z;
}
template <class T>
inline T _gcd(T a, T b) {
  a = abs(a);
  b = abs(b);
  if (!b) return a;
  return _gcd(b, a % b);
}
template <class T>
inline T _lcm(T a, T b) {
  a = abs(a);
  b = abs(b);
  return (a / _gcd(a, b)) * b;
}
template <class T>
inline T _extended(T a, T b, T &x, T &y) {
  a = abs(a);
  b = abs(b);
  T g, x1, y1;
  if (!b) {
    x = 1;
    y = 0;
    g = a;
    return g;
  }
  g = _extended(b, a % b, x1, y1);
  x = y1;
  y = x1 - (a / b) * y1;
  return g;
}
template <class T, class X>
inline bool getbit(T a, X i) {
  T t = 1;
  return ((a & (t << i)) > 0);
}
template <class T, class X>
inline T setbit(T a, X i) {
  T t = 1;
  return (a | (t << i));
}
template <class T, class X>
inline T resetbit(T a, X i) {
  T t = 1;
  return (a & (~(t << i)));
}
template <class T, class X>
inline T togglebit(T a, X i) {
  T t = 1;
  return (a ^ (t << i));
}
template <class T>
void pv(T v) {
  for (int i = 0; i < ((int)v.size()); i++) cout << v[i] << " ";
  cout << endl;
}
template <class T, class X>
inline T _bigmod(T n, X m) {
  unsigned long long ret = 1, a = n % 1000000007;
  while (m) {
    if (m & 1) ret = (ret * a) % 1000000007;
    m >>= 1;
    a = (a * a) % 1000000007;
  }
  ret %= 1000000007;
  return (T)ret;
}
template <class T>
inline T _modinv(T n) {
  return _bigmod(n, 1000000007 - 2);
}
map<long long, long long> mp;
void precal() {
  mp[0] = 1;
  for (int i = 1; i <= 100; i++) {
    mp[i] = mp[i - 1] * (long long)i;
    if (mp[i] > 1e16) break;
  }
  return;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  precal();
  long long n, k, s;
  vector<long long> vv[2];
  cin >> n >> k >> s;
  int n1, n2;
  n1 = n / 2;
  n2 = n - n1;
  for (int i = 1; i <= n1; i++) {
    int x;
    cin >> x;
    vv[0].push_back(x);
  }
  for (int i = 1; i <= n2; i++) {
    int x;
    cin >> x;
    vv[1].push_back(x);
  }
  vector<pair<long long, long long> > d[2];
  vector<long long> val[2];
  for (int k = 0; k <= 1; k++) {
    for (int b1 = 0; b1 <= (1 << ((int)vv[k].size())) - 1; b1++) {
      int t = __builtin_popcount(b1);
      for (int b = 0; b <= (1 << t) - 1; b++) {
        int i, j;
        long long tmp = 0;
        for (i = 0, j = 0; i < ((int)vv[k].size()) && tmp >= 0; i++) {
          if (getbit(b1, i)) {
            if (getbit(b, j)) {
              if (!mp[vv[k][i]]) {
                tmp = -1;
                break;
              } else {
                tmp += mp[vv[k][i]];
              }
            } else {
              tmp += vv[k][i];
            }
            j++;
          }
        }
        if (tmp >= 0) {
          d[k].push_back(make_pair(tmp, __builtin_popcountll(b)));
          val[k].push_back(tmp);
        }
      }
    }
    sort(d[k].begin(), d[k].end());
    sort(val[k].begin(), val[k].end());
  }
  long long ans = 0;
  for (int i = 0; i < ((int)val[0].size()); i++) {
    int l = (lower_bound(val[1].begin(), val[1].end(), s - val[0][i]) -
             val[1].begin()),
        r = (upper_bound(val[1].begin(), val[1].end(), s - val[0][i]) -
             val[1].begin()) -
            1;
    if (l <= r && l < ((int)val[1].size())) {
      int mx = k - d[0][i].second;
      long long low = l, high = r, mid, rt = l - 1;
      while (low <= high) {
        mid = (low + high) / 2;
        if (d[1][mid].second <= mx) {
          rt = mid;
          low = mid + 1;
        } else {
          high = mid - 1;
        }
      }
      if ((rt >= l && rt <= r)) {
        ans += rt - l + 1;
      }
    }
  }
  cout << ans << endl;
  return 0;
}
