#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
vector<mint>pw(300005);
struct S {
	mint val;
	int sz;
	S(mint val, int sz) :val(val), sz(sz) {}
};
S op(S a, S b) {
	mint val = a.val * pw[b.sz] + b.val;
	int sz = a.sz + b.sz;
	return S(val, sz);
}
S e() { return S(0, 0); }
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m, q; cin >> n >> m >> q;
	vector<int>a(n);
	rep(i, n)cin >> a[i], a[i]--;
	pw[0] = 1;
	rep2(i, 1, pw.size()) pw[i] = m * pw[i - 1];
	segtree<S, op, e>seg(n);
	rep(i, n) seg.set(i, { a[i],1 });
	while (q--) {
		int l, r; cin >> l >> r;
		l--;
		auto get = seg.prod(l, r);
		auto ans = get.val + 1;
		cout << ans.val() << endl;
	}
	return 0;
}