Problem: Anya loves to fold and stick. Today she decided to do just that.

Anya has n cubes lying in a line and numbered from 1 to n from left to right, with natural numbers written on them. She also has k stickers with exclamation marks. We know that the number of stickers does not exceed the number of cubes.

Anya can stick an exclamation mark on the cube and get the factorial of the number written on the cube. For example, if a cube reads 5, then after the sticking it reads 5!, which equals 120.

You need to help Anya count how many ways there are to choose some of the cubes and stick on some of the chosen cubes at most k exclamation marks so that the sum of the numbers written on the chosen cubes after the sticking becomes equal to S. Anya can stick at most one exclamation mark on each cube. Can you do it?

Two ways are considered the same if they have the same set of chosen cubes and the same set of cubes with exclamation marks.

Input

The first line of the input contains three space-separated integers n, k and S (1 ≤ n ≤ 25, 0 ≤ k ≤ n, 1 ≤ S ≤ 1016) — the number of cubes and the number of stickers that Anya has, and the sum that she needs to get. 

The second line contains n positive integers ai (1 ≤ ai ≤ 109) — the numbers, written on the cubes. The cubes in the input are described in the order from left to right, starting from the first one. 

Multiple cubes can contain the same numbers.

Output

Output the number of ways to choose some number of cubes and stick exclamation marks on some of them so that the sum of the numbers became equal to the given number S.

Examples

Input

2 2 30
4 3


Output

1


Input

2 2 7
4 3


Output

1


Input

3 1 1
1 1 1


Output

6

Note

In the first sample the only way is to choose both cubes and stick an exclamation mark on each of them.

In the second sample the only way is to choose both cubes but don't stick an exclamation mark on any of them.

In the third sample it is possible to choose any of the cubes in three ways, and also we may choose to stick or not to stick the exclamation mark on it. So, the total number of ways is six.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,mmx,popcnt,tune=native")
using namespace std;
const long long inf = (long long)1e18 + 228;
const long long cst = (long long)2e5 + 5;
const long long mod = (long long)1e9 + 7;
void operator delete(void*);
void ex(int exitCode = 0) { exit(exitCode); }
inline long long fact(long long x) {
  if (x == 0) return 1;
  return x * fact(x - 1);
}
long long n, k, s;
vector<long long> vc;
inline vector<pair<long long, long long>> f(long long l, long long r) {
  vector<pair<long long, long long>> ret;
  vector<long long> tk(r - l + 1, 0);
  while (!tk.back()) {
    long long tw = 0;
    for (int i = 0; i < tk.size() - 1; i++) {
      if (tk[i] == 2) tw++;
      if (vc[l + i] > 20 && tk[i] == 2) tw = 100;
    }
    if (tw <= k) {
      long long sm = 0;
      for (int i = 0; i < tk.size(); i++) {
        if (tk[i] == 0) continue;
        if (tk[i] == 1)
          sm += vc[l + i];
        else
          sm += fact(vc[l + i]);
      }
      ret.push_back(pair<long long, long long>(tw, sm));
    }
    tk[0]++;
    for (int i = 0; i < tk.size() - 1; i++) {
      tk[i + 1] += tk[i] / 3;
      tk[i] %= 3;
    }
  }
  return ret;
}
int main() {
  cin.tie(0)->sync_with_stdio(0);
  cout.tie(0);
  cin >> n >> k >> s;
  vc.resize(n);
  for (long long& i : vc) cin >> i;
  auto v1 = f(0, (n + 1) / 2);
  auto v2 = f((n + 1) / 2, n);
  cerr << "---";
  cerr.flush();
  vector<long long> mp[40];
  for (auto i : v2) {
    mp[i.first].push_back(i.second);
  }
  for (int i = 0; i < 40; i++) sort(mp[i].begin(), mp[i].end());
  if (mp[0].empty()) mp[0].push_back(0);
  long long ans = 0;
  for (auto i : v1) {
    for (int q = 0; q <= k - i.first; q++)
      ans += upper_bound(mp[q].begin(), mp[q].end(), s - i.second) -
             lower_bound(mp[q].begin(), mp[q].end(), s - i.second);
  }
  cout << ans;
  ex();
}