#############################################################

import sys
sys.setrecursionlimit(10**7)

from heapq import heappop,heappush
from collections import deque,defaultdict,Counter
from bisect import bisect_left, bisect_right
from itertools import product,combinations,permutations
from math import sin,cos
#from math import isqrt #DO NOT USE PyPy

ipt = sys.stdin.readline
iin = lambda :int(ipt())
lmin = lambda :list(map(int,ipt().split()))

MOD = 998244353
#############################################################

N,M,Q = lmin()
A = lmin()
query = [lmin() for _ in range(Q)]

p = [1]
ip = [1]

inv = pow(M,MOD-2,MOD)
for i in range(N+10):
    p.append(p[-1]*M%MOD)
    ip.append(ip[-1]*inv%MOD)

B = [0]*N
for i in range(N-1,-1,-1):
    B[i] = (A[i]-1)*p[N-1-i]%MOD

S = [0]*(N+1)
S[-1] = 1
for i in range(N-1,-1,-1):
    S[i] = (S[i+1]+B[i])%MOD

for l,r in query:
    ans = (S[l-1]-S[r])%MOD*ip[N-r]%MOD
    print((ans+1)%MOD)