mod = 998244353
N,M,Q = map(int,input().split())
A = list(map(lambda x: int(x)-1, input().split()))
acc_A = [0]
e = 1
for a in A[::-1]:
    acc_A.append((acc_A[-1] + a*e) % mod)
    e = (e * M) % mod
inv_M = pow(M, mod-2, mod)
inv_M_pow = [1]
for i in range(1, N+1):
    inv_M_pow.append((inv_M_pow[-1] * inv_M) % mod)
for _ in range(Q):
    l,r = map(int, input().split())
    print(((acc_A[-l] - acc_A[-r-1]) * inv_M_pow[N-r] + 1) % mod)