#include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
constexpr i64 mod = 998244353;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, m, k;
    cin >> n >> m >> k;
    vector c(n + 1, vector<i64>(n + 1));
    for (int i = 0; i <= n; i += 1) {
        for (int j = 0; j <= i; j += 1) {
            c[i][j] = j ? (c[i - 1][j] + c[i - 1][j - 1]) % mod : 1;
        }
    }
    vector f(n + 1, vector(k + 1, vector<i64>(n)));
    f[0][0][0] = 1;
    for (int i = 0, vi; i <= m; i += 1) {
        cin >> vi;
        auto g = f;
        i64 pv = 1;
        for (int j = 1; j <= n; j += 1) {
            pv = pv * vi % mod;
            for (int x = 0; x <= n; x += 1) {
                for (int y = 0; y <= k; y += 1) {
                    for (int z = 0; z < n; z += 1) {
                        int nx = x + j;
                        int ny = y + (z + j) % 2;
                        int nz = (z + j) / 2;
                        if (nx <= n and ny <= k and nz < n) {
                            g[nx][ny][nz] =
                                (g[nx][ny][nz] +
                                 f[x][y][z] * c[n - x][j] % mod * pv) %
                                mod;
                        }
                    }
                }
            }
        }
        f.swap(g);
    }
    i64 ans = 0;
    for (int i = 0; i <= k; i += 1) {
        for (int j = 0; j < n; j += 1) {
            if (popcount(unsigned(j)) + i <= k) {
                ans += f[n][i][j];
            }
        }
    }
    cout << ans % mod;
}