//#pragma GCC optimize("Ofast") //#pragma GCC optimize("unroll-loops") //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") #include using namespace std; using ll = long long; using ull = unsigned long long; using db = double; using ld = long double; template using V = vector; template using VV = vector>; #define fs first #define sc second #define pb push_back #define mp make_pair #define mt make_tuple #define eb emplace_back #define lb lower_bound #define ub upper_bound #define all(v) (v).begin(),(v).end() #define siz(v) (ll)(v).size() #define rep(i,a,n) for(ll i=a;i<(ll)(n);++i) #define repr(i,a,n) for(ll i=n-1;(ll)a<=i;--i) #define ENDL '\n' typedef pair Pi; typedef pair PL; constexpr ll mod = 998244353; constexpr ll INF = 1000000099; constexpr ll LINF = (ll)(1e18 +99); const ld PI = acos((ld)-1); const vector dx={-1,0,1,0},dy={0,1,0,-1}; template inline bool chmin(T& t, const U& u){if(t>u){t=u;return 1;}return 0;} template inline bool chmax(T& t, const U& u){if(t inline T gcd(T a,T b){return b?gcd(b,a%b):a;} inline void yes() { cout << "Yes" << ENDL; } inline void no() { cout << "No" << ENDL; } template inline T mpow(T a, Y n) { T res = 1; for(;n;n>>=1) { if (n & 1) res = res * a; a = a * a; } return res; } template V prefix_sum(const V& v) { int n = v.size(); V ret(n + 1); rep(i, 0, n) ret[i + 1] = ret[i] + v[i]; return ret; } template istream& operator >> (istream& is, vector& vec){ for(auto&& x: vec) is >> x; return is; } template ostream& operator<<(ostream& os,const pair& p){ return os<<"{"< ostream& operator<<(ostream& os,const V& v){ os<<"{"; for(auto e:v)os< void debug(Args&... args){ for(auto const& x:{args...}){ cerr< // MODを適宜設定すること struct Mint { using M = Mint; ll a; Mint(ll x = 0) { a = x % MOD; if(a < 0) a += MOD; } // Mintで M pow(ll n) { M b = *this, r = 1 % MOD; while(n) { if(n & 1) r *= b; b *= b; n >>= 1; } return r; } M inv() { return pow(MOD - 2); } M& operator+=(M r) { a += r.a; if(a >= MOD) a -= MOD; return *this; } M& operator-=(M r) { a += MOD - r.a; if(a >= MOD) a -= MOD; return *this; } M& operator*=(M r) { a = 1LL * a * r.a % MOD; return *this; } M& operator/=(M r) { return (*this) *= r.inv(); } M operator+(M r) const { return M(a) += r; }; M operator-(M r) const { return M(a) -= r; }; M operator*(M r) const { return M(a) *= r; }; M operator/(M r) const { return M(a) /= r; }; M operator-() const { return M() - *this; } friend ostream& operator<<(ostream& os, const M& r) { return os << r.a; } }; using M = Mint; /* using M = Mint; M xとint iの演算はx.a+=i またはx+=M{i} M(x).pow(exp) */ signed main(){ cin.tie(0);cerr.tie(0);ios::sync_with_stdio(false); cout<>n>>k; V v(n);cin>>v; M sum=0; rep(i,0,n)sum+=v[i]; cout<