#include <cstdio>
#include <iostream>
#include <algorithm>using namespace std;typedef long long LL;
const int N = 200005, MOD = 998244353, BLO = 987;int n, m, Q, k, res;
int fac[N], ifac[N], inv[N], prd[N];
int a[N], t[N], c[N], ans[N];struct Que {int l, r, k, id;inline friend bool operator < (Que a, Que b) {if (a.k != b.k) return a.k < b.k;return (a.l / BLO != b.l / BLO)? (a.l < b.l) : (a.r < b.r);}
} q[N];int Down(int x, int y) {if (x < y) throw;return (LL) fac[x] * ifac[x - y] % MOD;
}void Inc(int x) {if (!x) return;++c[a[x]];res = (LL) res * (t[a[x]] + k - c[a[x]] + 1) % MOD;
}
void Dec(int x) {if (!x) return;res = (LL) res * inv[t[a[x]] + k - c[a[x]] + 1] % MOD;--c[a[x]];
}void Solve(int ql, int qr) {int mk = (LL) k * m % MOD;prd[n] = 1;for (int i = n - 1; ~i; --i) {prd[i] = (LL) prd[i + 1] * (mk + n - i) % MOD;}res = 1;int l = 1, r = 0, L, R;for (int i = ql; i <= qr; ++i) {L = q[i].l; R = q[i].r;while (r < R) Inc(++r);while (l > L) Inc(--l);while (l < L) Dec(l++);while (r > R) Dec(r--);ans[q[i].id] = (LL) res * prd[r - l + 1] % MOD;}for (int i = l; i <= r; ++i) --c[a[i]];
}int main() {fac[0] = fac[1] = ifac[0] = ifac[1] = inv[1] = 1;for (int i = 2; i < N; ++i) {inv[i] = MOD - (LL) (MOD / i) * inv[MOD % i] % MOD;fac[i] = (LL) fac[i - 1] * i % MOD;ifac[i] = (LL) ifac[i - 1] * inv[i] % MOD;}scanf("%d%d%d", &n, &m, &Q);for (int i = 1; i <= n; ++i) {scanf("%d", &a[i]);++t[a[i]];}for (int i = 1; i <= Q; ++i) {scanf("%d%d%d", &q[i].l, &q[i].r, &q[i].k);q[i].id = i;}sort(q + 1, q + 1 + Q);for (int i = 1, j; i <= Q; i = j + 1) {for (j = i; j < Q && q[j + 1].k == q[j].k; ++j);k = q[i].k;Solve(i, j);}for (int i = 1; i <= Q; ++i) {printf("%d\n", ans[i]);}return 0;
}