#include <unordered_map>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <vector>
#include <bitset>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#define int long long
#define rep(i, a, b) for (int i = (a); i <= (b); i ++ )
#define rop(i, a, b) for (int i = (a); i < (b); i ++ )
#define dep(i, a, b) for (int i = (a); i >= (b); i -- )
#define dop(i, a, b) for (int i = (a); i > (b); i -- )

#define Darr(a, L, R) cerr << #a "[" << L << " ~ " << R << "] = "; rep(x, L, R) cerr << a[x] << " "; cerr << '\n';
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define D(x) (cerr << #x << " = " << x << '\n')
#define vit vector<int>::iterator
#define all(x) x.begin(), x.end()
#define min(a, b) (a < b ? a : b)
#define max(a, b) (a > b ? a : b)
#define chkmin(a, b) (a = min(a, b))
#define chkmax(a, b) (a = max(a, b))
#define sit set<int>::iterator
#define lowbit(x) (x & -x)
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pi acos(-1)
#define gc getchar
#define pc putchar
#define db double
#define y second
#define x first

using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<db, db> PDD;
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
const int mod = 998244353;
const int eps = 1e-9;

int T = 1;
void print(int x) { dep(i, 20, 0) pc(((x >> i) & 1) ? '1' : '0'); }
int qpow(int a, int b = mod - 2, int s = 1) { for (; b; b >>= 1, a = 1ll * a * a % mod) if (b & 1) s = 1ll * s * a % mod; return s; }
namespace IO {
	void read() { return; }
	void write(char ch) { pc(ch); return; }
	void write() { return; }
	template <typename T> void read(T &x) { x = 0; T w = 0; char ch = gc(); while (ch < '0' || ch > '9') w |= (ch == '-'), ch = gc(); while ('0' <= ch && ch <= '9') x = x * 10 + (ch ^ 48), ch = gc(); x = w ? -x : x; }
	template <typename T> void print(T x) { if (!x) return; print<T>(x / 10), pc((x % 10) ^ '0'); }
	template <typename T> void write(T x) { if (x > 0) print<T>(x); else if (x < 0) pc('-'), print<T>(-x); else pc('0'); }
	template <typename T> void write(T x, char en) { write<T>(x), pc(en); }
	template <typename T, typename ...T2> void read(T &s, T2 &...oth) { read(s); read(oth...); return; }
}; using namespace IO;

const int N = 33, M = 110;
int f[N][M][N][N], n, m, K, v[M], fac[N], inv[N], pw[M][M];
void sub() {
	read(n, m, K);
	rep(i, 0, m) read(v[i]);
	fac[0] = inv[0] = 1;
	rep(i, 1, n) fac[i] = fac[i - 1] * i % mod;
	inv[n] = qpow(fac[n]); dep(i, n - 1, 1) inv[i] = inv[i + 1] * (i + 1) % mod;
	rep(i, 0, m) rep(j, 0, n) pw[i][j] = qpow(v[i], j);
	auto C = [&](int n, int m) -> int {
		if (m > n) return 0ll;
		return fac[n] * inv[m] % mod * inv[n - m] % mod;
	};
	rep(i, 0, n) f[i][0][i][0] = C(n, i) * pw[0][i] % mod;
	rep(i, 0, n) rep(j, 0, m + 6) rep(k, 0, n) rep(l, 0, K) {
		if (!f[i][j][k][l]) continue;
		if (j < m) {
			rep(w, 0, n - i) 
				(f[i + w][j + 1][k / 2 + w][l + (k % 2)] += f[i][j][k][l] * C(n - i, w) % mod * pw[j + 1][w] % mod) %= mod;
		} else (f[i][j + 1][k / 2][l + (k % 2)] += f[i][j][k][l]) %= mod;
	} int ans = 0;
	rep(i, 0, K) ans = (ans + f[n][m + 6][0][i]) % mod;
	printf("%lld\n", ans); 
}
signed main() {
	while (T -- ) sub();
	return 0;
}