Problem: In "The Man in the High Castle" world, there are m different film endings. 

Abendsen owns a storage and a shelf. At first, he has n ordered films on the shelf. In the i-th month he will do:

  1. Empty the storage.
  2. Put k_i ⋅ m films into the storage, k_i films for each ending.
  3. He will think about a question: if he puts all the films from the shelf into the storage, then randomly picks n films (from all the films in the storage) and rearranges them on the shelf, what is the probability that sequence of endings in [l_i, r_i] on the shelf will not be changed? Notice, he just thinks about this question, so the shelf will not actually be changed.



Answer all Abendsen's questions.

Let the probability be fraction P_i. Let's say that the total number of ways to take n films from the storage for i-th month is A_i, so P_i ⋅ A_i is always an integer. Print for each month P_i ⋅ A_i \pmod {998244353}.

998244353 is a prime number and it is equal to 119 ⋅ 2^{23} + 1.

It is guaranteed that there will be only no more than 100 different k values.

Input

The first line contains three integers n, m, and q (1 ≤ n, m, q ≤ 10^5, n+q≤ 10^5) — the number of films on the shelf initially, the number of endings, and the number of months.

The second line contains n integers e_1, e_2, …, e_n (1≤ e_i≤ m) — the ending of the i-th film on the shelf.

Each of the next q lines contains three integers l_i, r_i, and k_i (1 ≤ l_i ≤ r_i ≤ n, 0 ≤ k_i ≤ 10^5) — the i-th query.

It is guaranteed that there will be only no more than 100 different k values.

Output

Print the answer for each question in a separate line.

Examples

Input

6 4 4
1 2 3 4 4 4
1 4 0
1 3 2
1 4 2
1 5 2


Output

6
26730
12150
4860


Input

5 5 3
1 2 3 4 5
1 2 100000
1 4 4
3 5 5


Output

494942218
13125
151632

Note

In the first sample in the second query, after adding 2 ⋅ m films into the storage, the storage will look like this: \{1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 4, 4\}.

There are 26730 total ways of choosing the films so that e_l, e_{l+1}, …, e_r will not be changed, for example, [1, 2, 3, 2, 2] and [1, 2, 3, 4, 3] are such ways.

There are 2162160 total ways of choosing the films, so you're asked to print (26730/2162160 ⋅ 2162160) mod 998244353 = 26730.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int mo = 998244353;
int fac[300005], inv[300005];
void init() {
  fac[0] = inv[0] = inv[1] = 1;
  for (int i = (int)(2); i <= (int)(300005 - 1); i++)
    inv[i] = 1ll * inv[mo % i] * (mo - mo / i) % mo;
  for (int i = (int)(1); i <= (int)(300005 - 1); i++) {
    fac[i] = 1ll * fac[i - 1] * i % mo;
    inv[i] = 1ll * inv[i - 1] * inv[i] % mo;
  }
}
int power(int x, int y) {
  int s = 1;
  for (; y;) {
    if (y & 1) s = 1ll * s * x % mo;
    if (y /= 2) x = 1ll * x * x % mo;
  }
  return s;
}
const int N = 100005;
int freq[N], cnt[N];
void add(int x) {
  cnt[freq[x]]--;
  cnt[++freq[x]]++;
}
void del(int x) {
  cnt[freq[x]]--;
  cnt[--freq[x]]++;
}
vector<int> heavy;
int n, m, Q;
int e[N], ans[N];
struct que {
  int l, r, k, id;
} q[N];
const int blk = 200;
bool cmpk(que a, que b) {
  return pair<int, int>(a.k, a.l - a.r) < pair<int, int>(b.k, b.l - b.r);
}
bool cmpmo(que a, que b) {
  return pair<int, int>(a.l / blk, a.r) < pair<int, int>(b.l / blk, b.r);
}
int main() {
  init();
  scanf("%d%d%d", &n, &m, &Q);
  for (int i = (int)(1); i <= (int)(n); i++) {
    scanf("%d", &e[i]);
    cnt[e[i]]++;
  }
  for (int i = (int)(1); i <= (int)(m); i++)
    if (cnt[i] >= blk) heavy.push_back(i);
  for (int i = (int)(1); i <= (int)(Q); i++) {
    scanf("%d%d%d", &q[i].l, &q[i].r, &q[i].k);
    q[i].id = i;
  }
  sort(q + 1, q + Q + 1, cmpk);
  for (int r = 1; r <= Q;) {
    int l = r, kk = q[l].k, res = 1, las = n, v = 1;
    for (; r <= Q && kk == q[r].k; r++)
      ;
    for (int i = (int)(1); i <= (int)(m); i++)
      res = 1ll * res * fac[kk + cnt[i]] % mo;
    for (int i = (int)(l); i <= (int)(r - 1); i++) {
      int len = q[i].r - q[i].l + 1;
      for (; las > len; v = 1ll * (1ll * m * kk + n - (--las)) % mo * v % mo)
        ;
      ans[q[i].id] = 1ll * res * v % mo;
    }
  }
  sort(q + 1, q + Q + 1, cmpmo);
  int l = 1, r = 0;
  memset(cnt, 0, sizeof(cnt));
  ;
  cnt[0] = m;
  for (int i = (int)(1); i <= (int)(n); i++) add(e[i]);
  for (int i = (int)(1); i <= (int)(Q); i++) {
    for (; q[i].l < l; del(e[--l]))
      ;
    for (; q[i].l > l; add(e[l++]))
      ;
    for (; q[i].r < r; add(e[r--]))
      ;
    for (; q[i].r > r; del(e[++r]))
      ;
    int res = 1;
    for (int j = (int)(0); j <= (int)(blk - 1); j++)
      if (cnt[j]) res = 1ll * res * power(inv[q[i].k + j], cnt[j]) % mo;
    for (int j : heavy)
      if (freq[j] >= blk) res = 1ll * res * inv[q[i].k + freq[j]] % mo;
    ans[q[i].id] = 1ll * ans[q[i].id] * res % mo;
  }
  for (int i = (int)(1); i <= (int)(Q); i++) printf("%d\n", ans[i]);
  return 0;
}