#include <bits/stdc++.h>

 using namespace std;

 typedef long long LL;

 const int maxn = ;

 LL a[maxn], f[maxn], S, ans;

 int n, m, k;

 map<int, LL> cnt[maxn];

 void dfs(int d, int used, LL s, int type)

 {

     if(d == m)

     {

         if(type == ) cnt[used][s]++;

         else for(int i = ; i + used <= k; i++) if(cnt[i].count(S - s)) ans += cnt[i][S - s];

         return;

     }

     dfs(d + , used, s, type);

     if(s + a[d] <= S) dfs(d + , used, s + a[d], type);

     if(a[d] <  && used < k && s + f[a[d]] <= S) dfs(d + , used + , s + f[a[d]], type);

 }

 int main()

 {

     f[] = f[] = ;

     for(int i = ; i < ; i++) f[i] = f[i - ] * i;

     cin >> n >> k >> S;

     for(int i = ; i < n; i++) cin >> a[i];

     sort(a, a + n);

     m = n / ;

     dfs(, , , );

     m = n;

     dfs(n / , , , );

     cout << ans << endl;

     return ;

 }