#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)


int main(){
    int n, m, q; cin >> n >> m >> q;
    vi a(n); rep(i, n){
        cin >> a[i];
        a[i]--;
    }
    vmi pw(n+1, mint(1));rep2(i, 1, n+1)pw[i] = pw[i-1]*mint(m);
    vmi iv(n+1); rep(i, n+1)iv[i] = pw[i].inv();
    vmi sum(n+1, mint(0));
    rep2(i, 1, n+1){
        sum[i] = sum[i-1] + mint(a[i-1])*pw[n-i];
    }
    while(q--){
        int l, r; cin >> l >> r;
        mint ans = sum[r] - sum[l-1];
        ans *= iv[n-r];
        cout << (ans + mint(1)).val() << endl;
    }

    return 0;
}