#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
const int maxn = 100010, P = 998244353;
int n, m, q, a[maxn], cnt[maxn], ans[maxn], occ[maxn], mul[maxn], inv[200010];
struct query {
  int l, r, id;
};
vector<query> Q[maxn];
int qp(int x, int y) {
  int z = 1;
  for (; y; y >>= 1, x = 1LL * x * x % P) {
    if (y & 1) z = 1LL * z * x % P;
  }
  return z;
}
int main() {
  scanf("%d %d %d", &n, &m, &q);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]), cnt[a[i]]++;
  }
  for (int i = 1, l, r, k; i <= q; i++) {
    scanf("%d %d %d", &l, &r, &k);
    Q[k].push_back((query){l, r, i});
  }
  for (int i = inv[0] = 1; i <= 200000; i++) {
    inv[i] = qp(i, P - 2);
  }
  for (int k = 0; k <= 100000; k++)
    if (!Q[k].empty()) {
      int SZ = n / sqrt(Q[k].size()) * 1.5 + 1;
      for (int i = mul[0] = 1; i <= n; i++) {
        long long t = (1LL * k * m + i) % P;
        mul[i] = 1LL * mul[i - 1] * t % P;
      }
      sort(Q[k].begin(), Q[k].end(), [&](query a, query b) {
        int t1 = (a.l - 1) / SZ, t2 = (b.l - 1) / SZ;
        if (t1 ^ t2) return t1 < t2;
        if (t1 & 1) return a.r > b.r;
        return a.r < b.r;
      });
      memset(occ, 0, sizeof(occ));
      int l = 1, r = 0, cur = 1;
      auto ins = [&](int x) {
        occ[a[x]]++;
        cur = 1LL * cur * (cnt[a[x]] + k - occ[a[x]] + 1) % P;
      };
      auto del = [&](int x) {
        cur = 1LL * cur * inv[cnt[a[x]] + k - occ[a[x]] + 1] % P;
        occ[a[x]]--;
      };
      for (auto p : Q[k]) {
        while (l > p.l) ins(--l);
        while (r < p.r) ins(++r);
        while (l < p.l) del(l++);
        while (r > p.r) del(r--);
        ans[p.id] = 1LL * cur * mul[n - (p.r - p.l + 1)] % P;
      }
    }
  for (int i = 1; i <= q; i++) {
    printf("%d\n", ans[i]);
  }
  return 0;
}
