1 #include<iostream>
 2 #include<cstdio>
 3 #include<cstdlib>
 4 #include<cstring>
 5 #include<string>
 6 #include<queue>
 7 #include<algorithm>
 8 #include<map>
 9 #include<iomanip>
10 #include<climits>
11 #include<string.h>
12 #include<numeric>
13 #include<cmath>
14 #include<stdlib.h>
15 #include<vector>
16 #include<stack>
17 #include<set>
18 #define FOR(x, b, e)  for(int x=b;x<=(e);x++)
19 #define REP(x, n)     for(int x=0;x<(n);x++)
20 #define mp(a,b)       make_pair(a,b)
21 #define INF 1e7
22 #define MAXN 100010
23 #define maxn 1000010
24 #define Mod 1000007
25 #define N 25
26 using namespace std;
27 typedef long long LL;
28 typedef pair<LL, int> P;
29 map<P, int> a, b;
30 LL f[N], S;
31 int val[N];
32 int _n, _k;
33
34 void dfs1(int pos, LL sum, int k) //前半部分
35 {
36     if (sum > S || k > _k) return;
37     if (pos > _n / 2) {
38         a[P(sum, k)]++;
39         return;
40     }
41     dfs1(pos + 1, sum + val[pos], k);
42     dfs1(pos + 1, sum, k);
43     if (val[pos] <= 20)          //20以上的阶乘大于10^16
44         dfs1(pos + 1, sum + f[val[pos]], k + 1);
45 }
46
47 void dfs2(int pos, LL sum, int k) //后半部分
48 {
49     if (sum > S || k > _k) return;
50     if (pos > _n)
51     {
52         b[P(sum, k)]++;
53         return;
54     }
55     dfs2(pos + 1, sum + val[pos], k);
56     dfs2(pos + 1, sum, k);
57     if (val[pos] <= 20)
58         dfs2(pos + 1, sum + f[val[pos]], k + 1);
59 }
60
61 void init()
62 {
63     f[0] = f[1] = 1;
64     FOR(i, 2, 20)
65         f[i] = i*f[i - 1];
66 }
67
68 int main()
69 {
70     init();
71     while (cin >> _n >> _k >> S) {
72         a.clear();
73         b.clear();
74         for (int i = 1; i <= _n; ++i)
75             cin >> val[i];
76         dfs1(1, 0, 0);
77         dfs2(_n / 2 + 1, 0, 0);
78         LL ans = 0;
79         map<P, int>::iterator it = a.begin();
80         for (; it != a.end(); it++) {
81             int j = (*it).first.second;
82             for (int i = 0; i + j <= _k; ++i) {
83                 if (b.count(mp(S - (it->first.first), i)))
84                     ans += (LL)it->second*b[mp(S - (it->first.first), i)];
85             }
86         }
87         cout << ans << endl;
88     }
89     return 0;
90 }