// #pragma GCC target("avx2") // #pragma GCC optimize("O3") // #pragma GCC optimize("unroll-loops") #include using namespace std; using ll = long long; using ld = long double; using pll = pair; using pii = pair; using vvl = vector>; using vvi = vector>; using vvpll = vector>; #define name4(i, a, b, c, d, e, ...) e #define rep(...) name4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) #define rep1(i, a) for(ll i = 0, _aa = a; i < _aa; i++) #define rep2(i, a, b) for(ll i = a, _bb = b; i < _bb; i++) #define rep3(i, a, b, c) for(ll i = a, _bb = b; (a <= i && i < _bb) or (a >= i && i > _bb); i += c) #define rrep(i, a, b) for (ll i=(a); i>(b); i--) #define pb push_back #define mkp make_pair #define ALL(A) A.begin(), A.end() #define elif else if constexpr ll INF = 1e18; // constexpr ll INF = LONG_LONG_MAX; // constexpr int MOD = 1000000007; constexpr int MOD = 998244353; constexpr ld EPS = 1e-10; const string digits = "0123456789"; const string ascii_lowercase = "abcdefghijklmnopqrstuvwxyz"; const string ascii_uppercase = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; const string ascii_letters = ascii_lowercase + ascii_uppercase; template vector> list2d(int N, int M, T init) { return vector>(N, vector(M, init)); } template vector>> list3d(int N, int M, int L, T init) { return vector>>(N, vector>(M, vector(L, init))); } template vector>>> list4d(int N, int M, int L, int O, T init) { return vector>>>(N, vector>>(M, vector>(L, vector(O, init)))); } template vector LIST(ll N) { vector A(N); rep(i, 0, N) cin >> A[i]; return A; } void print() { cout << '\n'; } void print(ld out) { cout << fixed << setprecision(15) << out << '\n'; } void print(double out) { cout << fixed << setprecision(15) << out << '\n'; } template void print(T out) { cout << out << '\n'; } template void print(pair out) { cout << out.first << ' ' << out.second << '\n'; } template void print(vector A) { rep(i, 0, A.size()) { cout << A[i]; cout << (i == A.size()-1 ? '\n' : ' '); } } template void print(deque A) { rep(i, 0, A.size()) { cout << A[i]; cout << (i == A.size()-1 ? '\n' : ' '); } } template void print(set S) { vector A(S.begin(), S.end()); print(A); } void Yes() { print("Yes"); } void No() { print("No"); } void YES() { print("YES"); } void NO() { print("NO"); } ll floor(ll a, ll b) { if (a < 0) { return (a-b+1) / b; } else { return a / b; } } ll ceil(ll a, ll b) { if (a >= 0) { return (a+b-1) / b; } else { return a / b; } } template pll divmod(ll a, T b) { ll d = a / b; ll m = a % b; return {d, m}; } template bool chmax(T &x, T y) { return (y > x) ? x = y, true : false; } template bool chmin(T &x, T y) { return (y < x) ? x = y, true : false; } template T sum(vector &A) { T res = 0; for (T a: A) res += a; return res; } template T max(vector &A) { return *max_element(ALL(A)); } template T min(vector &A) { return *min_element(ALL(A)); } ll toint(string s) { ll res = 0; for (char c : s) { res *= 10; res += (c - '0'); } return res; } int toint(char num) { return num - '0'; } char tochar(int num) { return '0' + num; } int ord(char c) { return (int)c; } char chr(int a) { return (char)a; } ll pow(int x, int n) { ll res = 1; rep(_, 0, n) res *= x; return res; } ll pow(int x, ll n) { ll res = 1; rep(_, 0, n) res *= x; return res; } ll pow(ll x, int n) { ll res = 1; rep(_, 0, n) res *= x; return res; } ll pow(ll x, ll n) { ll res = 1; rep(_, 0, n) res *= x; return res; } ll pow(ll x, ll n, int mod) { ll res = 1; while (n > 0) { if (n & 1) { res = (res * x) % mod; } x = (x * x) % mod; n >>= 1; } return res; } int popcount(ll S) { return __builtin_popcountll(S); } ll gcd(ll a, ll b) { return __gcd(a, b); } ll lcm(ll x, ll y) { return (x * y) / gcd(x, y); } template int bisect_left(vector &A, T val) { return lower_bound(ALL(A), val) - A.begin(); } template int bisect_right(vector &A, T val) { return upper_bound(ALL(A), val) - A.begin(); } template ll bisearch_min(ll mn, ll mx, const F &func) { ll ok = mx, ng = mn; while (ng+1 < ok) { ll mid = (ok+ng) / 2; if (func(mid)) ok = mid; else ng = mid; } return ok; } template ll bisearch_max(ll mn, ll mx, const F &func) { ll ok = mn, ng = mx; while (ok+1 < ng) { ll mid = (ok+ng) / 2; if (func(mid)) ok = mid; else ng = mid; } return ok; } template unordered_map Counter(vector &A) { unordered_map res; for (T a : A) res[a]++; return res; } unordered_map Counter(string &S) { unordered_map res; for (char c : S) res[c]++; return res; } template struct ModInt { int x; ModInt() : x(0) {} ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {} ModInt &operator+=(const ModInt &p) { if((x += p.x) >= mod) x -= mod; return *this; } ModInt &operator-=(const ModInt &p) { if((x += mod - p.x) >= mod) x -= mod; return *this; } ModInt &operator*=(const ModInt &p) { x = (int) (1LL * x * p.x % mod); return *this; } ModInt &operator/=(const ModInt &p) { *this *= p.inverse(); return *this; } ModInt operator-() const { return ModInt(-x); } ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; } ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; } ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; } ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; } bool operator==(const ModInt &p) const { return x == p.x; } bool operator!=(const ModInt &p) const { return x != p.x; } ModInt inverse() const { int a = x, b = mod, u = 1, v = 0, t; while(b > 0) { t = a / b; swap(a -= t * b, b); swap(u -= t * v, v); } return ModInt(u); } ModInt pow(int64_t n) const { ModInt ret(1), mul(x); while(n > 0) { if(n & 1) ret *= mul; mul *= mul; n >>= 1; } return ret; } friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; } friend istream &operator>>(istream &is, ModInt &a) { int64_t t; is >> t; a = ModInt< mod >(t); return (is); } static int get_mod() { return mod; } // operator int() const { return x; } }; using mint = ModInt; // 行列累乗 template struct MatPow { MatPow() {} vector> mat_dot(vector> &A, vector> &B) { int n1 = A.size(); int n2 = A[0].size(); int m2 = B[0].size(); auto res = list2d(n1, m2, (T)0); rep(i, 0, n1) { rep(j, 0, m2) { rep(k, 0, n2) { res[i][j] += A[i][k]*B[k][j]; } } } return res; } vector> mat_pow(vector> mat, ll k) { int n = mat.size(); auto res = list2d(n, n, (T)0); rep(i, 0, n) { res[i][i] = 1; } while (k > 0) { if (k & 1) { res = mat_dot(res, mat); } mat = mat_dot(mat, mat); k >>= 1; } return res; } vector solve(vector> mat, vector &_init, ll K) { int n = mat.size(); auto init = list2d(n, 1, (T)0); rep(i, 0, n) init[i][0] = _init[i]; auto res = mat_pow(mat, K); res = mat_dot(res, init); vector ret(n, 0); rep(i, 0, n) ret[i] = res[i][0]; return ret; } }; void solve() { ll N, K; cin >> N >> K; auto A = LIST(N); mint invN = (mint)1/(mint)N; vector> mat = { {1, N}, {invN, 1}, }; vector init = { sum(A), (mint)sum(A)*invN }; MatPow mp; auto res = mp.solve(mat, init, K); print(res[0]); } int main() { cin.tie(0); ios::sync_with_stdio(false); // single test case solve(); // multi test cases // int T; // cin >> T; // while (T--) solve(); return 0; }