rt，记忆化搜索，但是炸了。RE on #11,#12,#13,#14,#15,#16,#19,#20。

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod = 998244353;
int n, m, k, v[35][105], f[105][35][35][35], C[35][35];
//f[i][j][k][l] : v 数组选道第 i 个,填了 j 个,当前位上位 k,[1,j) 位上共有 l 个 1 的方案总数
inline void init(){
	C[1][0] = C[1][1] = 1;
	for(int i = 2; i <= n; i++){
		C[i][0] = 1;
		for(int j = 1; j <= i; j++){
			C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % mod;
		}
	}
}
inline int calc(int x){
	int res = 0;
	while(x){
		res++;
		x =  x & (x - 1);
	}
	return res;
}
inline int dfs(int a, int b, int c, int d){
	if(b == n) return calc(c) + d <= k;
	if(a > m) return 0ll;
	if(~f[a][b][c][d]) return f[a][b][c][d];
	int res = 0;
	for(int i = 0; i + b <= n; i++){
		res += dfs(a + 1, b + i, c + i >> 1, d + ((c + i) & 1)) * C[n - b][i] % mod * v[a][i] % mod;
		res %= mod;
	}
	return f[a][b][c][d] = res;
}
signed main(){
	memset(f, -1, sizeof(f));
	scanf("%lld%lld%lld", &n, &m, &k);
	for(int i = 0; i <= m; i++){
		scanf("%lld", &v[i][1]);
		v[i][0] = 1;
		for(int j = 2; j <= n; j++) v[i][j] = v[i][j - 1] * v[i][1] % mod;
	} 
	init();
	printf("%lld", dfs(0, 0, 0, 0));
	return 0;
}