#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main(){
  ll n,m,q,a,b,mod(998244353); cin >> n >> m >> q;
  vector<ll> A(n),dp(n+1),pow(n+1,1);
  for (int i(0);i < n;++i){
    cin >> A[i]; --A[i];
    dp[i+1] = (dp[i]*m+A[i])%mod;
    pow[i+1] = (pow[i]*m)%mod;
  }
  while(q--){
    cin >> a >> b;
    a = (dp[b]-dp[a-1]*pow[b-a+1]+1)%mod;
    if (a<0) a=mod+a;
    cout << a << endl;
  }
}