N,M,Q=list(map(int,input().split()))
A=list(map(int,input().split()))
mod=998244353
A.reverse()
S=[0]
for (i,a) in enumerate(A):
    S.append((S[-1]+(a-1)*pow(M,i,mod))%mod)

for _ in range(Q):
    l,r=list(map(int,input().split()))
    ans=S[N-l+1]-S[N-r]
    ans+=mod
    ans%=mod
    ans*=pow(M,-N+r,mod)
    ans+=1
    ans%=mod
    print(ans)