def main():
    mod = 998244353
    N,M,Q = map(int,input().split())
    assert 1 <= N <= 2*10**5
    assert 1 <= M <= 2*10**5
    assert 1 <= Q <= 2*10**5
    A = list(map(lambda x: int(x)-1, input().split()))
    for a in A:
        assert 0 <= a <= M-1
    acc_A = [0]
    e = 1
    for a in A[::-1]:
        acc_A.append((acc_A[-1] + a*e) % mod)
        e = (e * M) % mod
    # Mの逆元
    inv_M = pow(M, mod-2, mod)
    # Mのi乗の逆元を前計算
    inv_M_list = [1]
    for i in range(1, N+1):
        inv_M_list.append((inv_M_list[-1] * inv_M) % mod)
    for _ in range(Q):
        l,r = map(int, input().split())
        assert 1 <= l <= r <= N
        print(((acc_A[-l] - acc_A[-r-1]) * inv_M_list[N-r] + 1) % mod)
    
if __name__ == "__main__":
    main()