MOD = 998244353

n, k = map(int, input().split())
a = list(map(int, input().split()))

sum_a = sum(a) % MOD

if k == 0:
    print(sum_a % MOD)
else:
    exponent = pow(2, k, MOD-1)  # Using Fermat's little theorem for pow(2, k, MOD)
    pow_2k = pow(2, k, MOD)
    res = (sum_a * pow_2k) % MOD
    print(res)