using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, m, q) = (c[0], c[1], c[2]);
        var a = NList;

        var mod = 998_244_353;
        var mul = new long[n + 1];
        mul[n] = 1;
        for (var i = n - 1; i >= 0; --i) mul[i] = mul[i + 1] * m % mod;
        var hash = new long[n + 1];
        for (var i = 0; i < n; ++i) hash[i + 1] = (hash[i] + mul[i + 1] * (a[i] - 1) % mod) % mod;
        var rev = new long[n + 1];
        rev[0] = Exp(mul[0], mod - 2, mod);
        for (var i = 1; i < rev.Length; ++i) rev[i] = rev[i - 1] * m % mod;

        var ans = new long[q];
        for (var i = 0; i < q; ++i)
        {
            c = NList;
            ans[i] = ((hash[c[1]] + mod - hash[c[0] - 1]) % mod * rev[c[1]] % mod + 1) % mod;
        }
        WriteLine(string.Join("\n", ans));
    }
    static long Exp(long n, long p, int mod)
    {
        long _n = n % mod;
        var _p = p;
        var result = 1L;
        if ((_p & 1) == 1) result *= _n;
        while (_p > 0)
        {
            _n = _n * _n % mod;
            _p >>= 1;
            if ((_p & 1) == 1) result = result * _n % mod;
        }
        return result;
    }
}