// Skyqwq
#include <bits/stdc++.h>

#define pb push_back
#define fi first
#define se second
#define mp make_pair

using namespace std;

typedef pair<int, int> PII;
typedef long long LL;

template <typename T> bool chkMax(T &x, T y) { return (y > x) ? x = y, 1 : 0; }
template <typename T> bool chkMin(T &x, T y) { return (y < x) ? x = y, 1 : 0; }

template <typename T> void inline read(T &x) {
    int f = 1; x = 0; char s = getchar();
    while (s < '0' || s > '9') { if (s == '-') f = -1; s = getchar(); }
    while (s <= '9' && s >= '0') x = x * 10 + (s ^ 48), s = getchar();
    x *= f;
}

typedef vector<int> Poly;

#define pb push_back

const int N = 1e5 + 5, P = 998244353, G = 3;

int A[N], rev[N], mod, inv[N], fact[N], infact[N];
int lim = 1, len = 0, W[20][N];

int inline power(int a, int b, int Mod = P) {
	int res = 1;
	while (b) {
		if (b & 1) res = (LL)res * a % Mod;
		a = (LL)a * a % Mod;
		b >>= 1;
	}
	return res;
}


int Gi = power(G, P - 2, P), inv2 = power(2, P - 2, P);



void inline NTT(int c[], int lim, int o) {
	for (int i = 0; i < lim; i++)
		if (i < rev[i]) swap(c[i], c[rev[i]]);
	for (int k = 1, t = 0; k < lim; k <<= 1, t++) {
		for (int i = 0; i < lim; i += (k << 1)) {
			for (int j = 0; j < k; j++) {
				int u = c[i + j], v = (LL)c[i + k + j] * W[t][j] % P;
				c[i + j] = u + v >= P ? u + v - P : u + v;
				c[i + j + k] = u - v < 0 ? u - v + P : u - v; 
			}
		}
	}
	if (o == -1) {
		reverse(c + 1, c + lim);
		int inv = power(lim, P - 2, P);
		for (int i = 0; i < lim; i++)
			c[i] = (LL)c[i] * inv % P;
	}
}

void inline setN(int n) {
	lim = 1, len = 0;
	while (lim < n) lim <<= 1, len++;
	for (int i = 0; i < lim; i++)
		rev[i] = (rev[i >> 1] >> 1) | ((i & 1) << (len - 1));
}

Poly inline NTT(Poly a, int o) {
	int n = a.size();
	for (int i = 0; i < n; i++) A[i] = a[i];
	NTT(A, lim, o);
	a.clear();
	for (int i = 0; i < lim; i++) a.push_back(A[i]), A[i] = 0;
	return a;
}

Poly operator + (const Poly a, const Poly b)  {
	Poly c(max(a.size(), b.size()));
	for (int i = 0; i < c.size(); i++) {
		if (i < a.size()) {
			c[i] += a[i]; if (c[i] >= P) c[i] -= P;
		}
		if (i < b.size()) {
			c[i] += b[i]; if (c[i] >= P) c[i] -= P;
		}
	}
	return c;
}


Poly operator - (const Poly a, const Poly b)  {
	Poly c(max(a.size(), b.size()));
	for (int i = 0; i < c.size(); i++) {
		if (i < a.size()) {
			c[i] += a[i]; if (c[i] >= P) c[i] -= P;
		}
		if (i < b.size()) {
			c[i] -= b[i]; if (c[i] < 0) c[i] += P;
		}
	}
	return c;
}

Poly inline mul (Poly a, Poly b, int newn = -1) {
	if (newn == -1) newn = a.size() + b.size() - 1;
	setN(a.size() + b.size() - 1);
	Poly c = NTT(a, 1), d = NTT(b, 1);
	for (int i = 0; i < lim; i++) c[i] = (LL)c[i] * d[i] % P;
	d = NTT(c, -1); d.resize(newn);
	return d;
}

Poly inline reverse(Poly a) {
	int n = a.size() - 1;
	for (int i = 0; i < n - i; i++) swap(a[i], a[n - i]);
	return a;
}

Poly inline dx(Poly a) {
	int n = a.size();
	Poly b; b.resize(n - 1);
	for (int i = 0; i < b.size(); i++) b[i] = a[i + 1] * (i + 1ll) % P;
	return b;
}

Poly inline F(Poly a) {
	int n = a.size();
	Poly b; b.resize(n + 1);
	for (int i = 1; i < b.size(); i++) b[i] = (LL)a[i - 1] * inv[i] % P;
	return b;
}
 
Poly polyInv(Poly a) {
	int n = a.size();
	if (n == 1) { Poly b; b.push_back(power(a[0], P - 2, P)); return b;}
	Poly b = a; b.resize((n + 1) >> 1);
	b = polyInv(b);
	setN(2 * n);
	a = NTT(a, 1), b = NTT(b, 1);
	for (int i = 0; i < lim; i++)
		b[i] = (LL)b[i] * (2ll - (LL)a[i] * b[i] % P + P) % P;
	b = NTT(b, -1);
	b.resize(n);
	return b;
}

// 注意必须保证 n >= m
void inline div (Poly a, Poly b, Poly &Q, Poly &R) {
	int n = a.size() - 1, m = b.size() - 1;
	Poly ar = reverse(a), br = reverse(b);
	ar.resize(n - m + 1), br.resize(n - m + 1);
	Q = reverse(mul(ar, polyInv(br), n - m + 1));
	R = a - mul(b, Q); R.resize(m);
}


Poly t(1, 1);

Poly inline ln(Poly a) {
	Poly b = F(mul(dx(a), polyInv(a)));
	b.resize(a.size());
	return b;
}

Poly exp(Poly a) {
	int n = a.size();
	if (n == 1) return t;
	Poly b = a; b.resize((n + 1) >> 1);
	b = exp(b); b.resize(n);
	Poly c = a - ln(b);
	(c[0] += 1) %= P;
	b = mul(b, c, a.size()); 
	return b;
}

void cdq(int l, int r) {
	if (r - l <= 0) return;
	int mid = (l + r) >> 1, len = r - l;
	cdq(l, mid);
	// Do sth
	cdq(mid + 1, r);
}

void inline preInv(int n) {
	inv[1] = 1;
	for (int i = 2; i <= n; i++)
		inv[i] = ((LL)P - P / i) * inv[P % i] % P;
}


bool ok = false;

Poly inline power(Poly a, int b) {
	int Mul = 1, Cy = 0, n = a.size();
	if (b == 0) {
		Poly c(n, 0);
		c[0] = power(a[0], b, P);
		return c;
	}
	if (a[0] == 0) {
		for (Cy = 1; Cy < n; Cy++) if (a[Cy]) break;
		if (ok || (LL)Cy * b >= n) {
			Poly c(n, 0);
			return c;
		}
		for (int i = 0; i + Cy < n; i++) a[i] = a[i + Cy];
		for (int i = n - Cy; i < n; i++) a[i] = 0;
		Cy *= b;
	}
	if (a[0] != 1) {
		int in = power(a[0], P - 2, P); Mul = power(a[0], b, P);
		for (int i = 0; i < n; i++) a[i] = (LL)a[i] * in % P;
	}
	a = ln(a);
	for (int i = 0; i < n; i++) a[i] = (LL)a[i] * b % P;
	a = exp(a);
	if (Mul != 1) for (int i = 0; i < n; i++) a[i] = (LL)a[i] * Mul % P;
	if (Cy) {
		for (int i = n - 1; i >= Cy; i--) a[i] = a[i - Cy];
		for (int i = 0; i < Cy; i++) a[i] = 0;
	}
	return a;
}

void inline factPrework(int n) {
	fact[0] = infact[0] = 1;
	for (int i = 1; i <= n; i++) fact[i] = (LL)fact[i - 1] * i % P;
	infact[n] = power(fact[n], P - 2);
	for (int i = n - 1; i; i--) infact[i] = infact[i + 1] * (i + 1ll) % P;
}


// 用到的最大的 n
void inline init(int n) {
	preInv(n);
	factPrework(n);
	setN(2 * n);
	for (int k = 1, t = 0; k < lim; k <<= 1, t++) {
		int wn = power(G, (P - 1) / (k << 1));
		W[t][0] = 1;
		for (int j = 1; j < k; j++) W[t][j] = (LL)W[t][j - 1] * wn % P;
	}
}

int n, m, a[N], w[N];

void inline add(int &x, int y) {
	x += y;
	if (x >= P) x -= P;
}

Poly X[N << 2], Y[N << 2];

#define ls (p << 1)
#define rs (p << 1 | 1)

void solve(int p, int l, int r) {
	if (l == r) {
		X[p].pb(1);
		X[p].pb(P - a[r]);
		Y[p].pb(1);
		return;
	}
	int mid = (l + r) >> 1;
	solve(ls, l, mid);
	solve(rs, mid + 1, r);
	X[p] = mul(X[ls], X[rs]);
	Y[p] = mul(X[ls], Y[rs]) + mul(Y[ls], X[rs]);
}

void inline wk() {
	solve(1, 1, n);
	Poly T = mul(Y[1], polyInv(X[1]));
	for (int i = 0; i <= n; i++) {
		w[i] = T[i];
	}
}

int main() {
	init(3e4);
    read(n), read(m);
    for (int i = 1; i <= n; i++) read(a[i]);
    if (n == 1) {
    	puts(!m ? "1" : "0");
    	return 0;
    }
    // calc wi = sum a[j]^i ()
    wk();
    // --
    Poly A(n + 1, 0);
    Poly B(n + 1, 0);
    for (int i = 0; i <= n; i++) A[i] = 1ll * infact[i] * power(i + 1, m) % P;
    for (int i = 0; i <= n; i++) B[i] = 1ll * infact[i] * power(i + 1, 2 * m) % P;
    Poly C = ln(A);
	for (int i = 0; i <= n; i++) C[i] = 1ll * C[i] * w[i] % P;
	C = exp(C);
	Poly D = mul(B, polyInv(A), n + 1);
	for (int i = 0; i <= n; i++) D[i] = 1ll * D[i] * w[i] % P;
	Poly G = mul(C, D, n + 1);
	int ans = 1ll * G[n - 2] * fact[n - 2] % P;
	for (int i = 1; i <= n; i++) ans = 1ll * ans * a[i] % P;
	printf("%d\n", ans);
    return 0;
}