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.
#include <bits/stdc++.h>
using namespace std;
int get() {
  char ch;
  while (ch = getchar(), (ch < '0' || ch > '9') && ch != '-')
    ;
  if (ch == '-') {
    int s = 0;
    while (ch = getchar(), ch >= '0' && ch <= '9') s = s * 10 + ch - '0';
    return -s;
  }
  int s = ch - '0';
  while (ch = getchar(), ch >= '0' && ch <= '9') s = s * 10 + ch - '0';
  return s;
}
const int N = 1e5 + 5;
const int mo = 998244353;
long long add(long long x, long long y) {
  return x + y >= mo ? x + y - mo : x + y;
}
long long dec(long long x, long long y) { return x < y ? x - y + mo : x - y; }
long long quickmi(long long x, long long tim) {
  long long ret = 1;
  for (; tim; tim /= 2, x = x * x % mo)
    if (tim & 1) ret = ret * x % mo;
  return ret;
}
long long inv[N * 2], js[N * 2];
void prepare() {
  js[0] = js[1] = 1;
  for (int i = 2; i <= 2e5; i++) js[i] = js[i - 1] * i % mo;
  inv[0] = inv[1] = 1;
  for (int i = 2; i <= 2e5; i++)
    inv[i] = 1ll * (mo - mo / i) * inv[mo % i] % mo;
}
int n, m, q;
int a[N];
struct Query {
  int l, r, k;
  int id;
} qry[N];
long long ans[N];
map<int, int> id;
int v[105];
int k;
long long val[105][N];
int blk;
int be[N];
long long nv[105];
int cnt[N];
int all[N];
bool cmp(Query a, Query b) {
  return be[a.l] != be[b.l] ? be[a.l] < be[b.l] : a.r < b.r;
}
void add(int i, int c) {
  cnt[c]++;
  nv[i] = nv[i] * (v[i] + all[c] - cnt[c] + 1) % mo;
}
void del(int i, int c) {
  nv[i] = nv[i] * inv[v[i] + all[c] - cnt[c] + 1] % mo;
  cnt[c]--;
}
void add(int c) {
  cnt[c]++;
  for (int i = 1; i <= k; i++)
    nv[i] = nv[i] * (v[i] + all[c] - cnt[c] + 1) % mo;
}
int main() {
  prepare();
  n = get();
  m = get();
  q = get();
  for (int i = 1; i <= n; i++) {
    a[i] = get();
    all[a[i]]++;
  }
  for (int i = 1; i <= q; i++) {
    qry[i].l = get(), qry[i].r = get(), qry[i].k = get();
    qry[i].id = i;
    if (!id[qry[i].k]) {
      id[qry[i].k] = ++k;
      v[k] = qry[i].k;
    }
  }
  for (int i = 1; i <= k; i++) {
    long long now = v[i];
    val[i][0] = 1;
    for (int x = 1; x <= n; x++)
      val[i][x] = val[i][x - 1] * (now * m % mo + x) % mo;
  }
  blk = sqrt(1.0 * n * n * k / q) + 1;
  for (int i = 1; i <= n; i++) be[i] = (i - 1) / blk + 1;
  sort(qry + 1, qry + 1 + q, cmp);
  int w = 1;
  for (int L = 1; L <= n; L += blk) {
    for (int i = 1; i <= m; i++) cnt[i] = 0;
    for (int i = 1; i <= k; i++) nv[i] = 1;
    while (w <= q && be[qry[w].l] == be[L] && be[qry[w].r] == be[L]) {
      int tk = id[qry[w].k];
      for (int i = qry[w].l; i <= qry[w].r; i++) add(tk, a[i]);
      ans[qry[w].id] = nv[tk] * val[tk][n - (qry[w].r - qry[w].l + 1)] % mo;
      for (int i = qry[w].l; i <= qry[w].r; i++) del(tk, a[i]);
      w++;
    }
    for (int R = L + blk; R <= n; R++) {
      add(a[R]);
      while (w <= q && be[qry[w].l] == be[L] && qry[w].r == R) {
        int tk = id[qry[w].k];
        for (int i = L + blk - 1; i >= qry[w].l; i--) add(tk, a[i]);
        ans[qry[w].id] = nv[tk] * val[tk][n - (qry[w].r - qry[w].l + 1)] % mo;
        for (int i = qry[w].l; i <= L + blk - 1; i++) del(tk, a[i]);
        w++;
      }
    }
  }
  for (int i = 1; i <= q; i++) printf("%I64d\n", ans[i]);
  return 0;
}
