#include using namespace std; #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include using namespace atcoder; template inline bool chmax(T &a, T b) { return ((a < b) ? (a = b, true) : (false)); } template inline bool chmin(T &a, T b) { return ((a > b) ? (a = b, true) : (false)); } #define rep(i, n) for (long long i = 0; i < (long long)(n); i++) #define rep2(i, m ,n) for (int i = (m); i < (long long)(n); i++) #define REP(i, n) for (long long i = 1; i < (long long)(n); i++) typedef long long ll; #define updiv(N,X) (N + X - 1) / X #define l(n) n.begin(),n.end() #define YesNo(Q) Q==1?cout<<"Yes":cout<<"No" using P = pair; using mint = modint; const int MOD = 1000000007LL; const ll INF = 999999999999LL; vector fact, fact_inv, inv; /* init_nCk :二項係数のための前処理 計算量:O(n) */ template void input(vector &v){ rep(i,v.size()){cin>>v[i];} return; } void init_nCk(int SIZE) { fact.resize(SIZE + 5); fact_inv.resize(SIZE + 5); inv.resize(SIZE + 5); fact[0] = fact[1] = 1; fact_inv[0] = fact_inv[1] = 1; inv[1] = 1; for (int i = 2; i < SIZE + 5; i++) { fact[i] = fact[i - 1] * i % MOD; inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD; fact_inv[i] = fact_inv[i - 1] * inv[i] % MOD; } } /* nCk :MODでの二項係数を求める(前処理 int_nCk が必要) 計算量:O(1) */ long long nCk(int n, int k) { if(n < k){return 1;} if(n < 0 || k < 0){return 1;} return fact[n] * (fact_inv[k] * fact_inv[n - k] % MOD) % MOD; } long long modpow(long long a, long long n, long long mod) { long long res = 1; while (n > 0) { if (n & 1) res = res * a % mod; a = a * a % mod; n >>= 1; } return res; } ll POW(ll a,ll n){ long long res = 1; while (n > 0) { if (n & 1) res = res * a; a = a * a; n >>= 1; } return res; } mint cum[4]; bool fcomp(const pair& a, const pair& b) { return a.first*b.second > b.first*a.second; } int main() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); ll n,m,q;cin>>n>>m>>q; vector mdp(n+1,1); rep(i,n){mdp[i+1] = (mdp[i]*m)%998244353LL;} vector v(n); rep(i,n){ ll t;cin>>t;t--; v[i] = t; v[i] *= mdp[n-i]; } vector cum(n+1,0); rep(i,n){cum[i+1] = cum[i]+v[i];} rep(i,q){ ll l,r;cin>>l>>r;l--;r--; mint ans = cum[r+1]-cum[l]; ans /= mdp[n-r]; ans++; cout << ans.val() << endl; } }