#include <bits/stdc++.h>
     
    #define INF 1e9
    #define LINF (1LL << 63 - 1)
    #define rep(i,n)for(int i=0;(i)<(int)(n);i++)
    #define REP(i,a,b)for(int i=(int)(a);(i)<=(int)(b);i++)
    #define ALL(a)  (a).begin(),(a).end()
    // #define chmax(a, b) a = max(a, b)
    // #define chmin(a, b) a = min(a, b)
    #define pb push_back
    #define fi first
    #define se second
    #define sz(x) ((int)x.size())
     
    using namespace std;
    //using namespace atcoder;
    using ld = long double;
    using ll = long long;
    using P = pair<ll, ll>;
     
    template<typename T> bool chmin(T& a, const T& b) { if(a > b){ a = b; return 1;} return 0; }
    template<typename T> bool chmax(T& a, const T& b) { if(a < b){ a = b; return 1;} return 0; }
     
    const ll ZER = 0;
    const ll MOD = 1e9 + 7;
     
    
    
    template<int MOD> struct Fp {
        long long val;
        constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
            if (val < 0) val += MOD;
        }
        constexpr int getmod() { return MOD; }
        constexpr Fp operator - () const noexcept {
            return val ? MOD - val : 0;
        }
        constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
        constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
        constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
        constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
        constexpr Fp& operator += (const Fp& r) noexcept {
            val += r.val;
        if (val >= MOD) val -= MOD;
            return *this;
        }
        constexpr Fp& operator -= (const Fp& r) noexcept {
            val -= r.val;
            if (val < 0) val += MOD;
            return *this;
        }
        constexpr Fp& operator *= (const Fp& r) noexcept {
            val = val * r.val % MOD;
            return *this;
        }
        constexpr Fp& operator /= (const Fp& r) noexcept {
            long long a = r.val, b = MOD, u = 1, v = 0;
            while (b) {
                long long t = a / b;
                a -= t * b; swap(a, b);
                u -= t * v; swap(u, v);
            }
            val = val * u % MOD;
            if (val < 0) val += MOD;
            return *this;
        }
        constexpr bool operator == (const Fp& r) const noexcept {
            return this->val == r.val;
        }
        constexpr bool operator != (const Fp& r) const noexcept {
            return this->val != r.val;
        }
        friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {
            return os << x.val;
        }
        friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
            if (n == 0) return 1;
            auto t = modpow(a, n / 2);
            t = t * t;
            if (n & 1) t = t * a;
            return t;
        }
    };
    using mint = Fp<998244353>;
    int main(){
        // std::cin.tie(0);
        // std::ios::sync_with_stdio(false);
     
        ll n, tmp;
        cin >> n >> tmp;
        mint k = tmp;
        mint sum = 0;
        rep(i, n){
            ll a;
            cin >> a;
            sum += (mint)a;
        }
        mint res = sum * k + sum;
        
        cout << res << endl;
    }