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;
template <typename T, typename U>
inline void smin(T &a, const U &b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, const U &b) {
  if (a < b) a = b;
}
const int mod = 998244353;
int cnt[200200];
int e[200200];
int flag[200200], kval[200200], cur;
int M;
struct query {
  int L, R, id;
  query(int L = 0, int R = 0, int id = 0) : L(L), R(R), id(id) {}
  bool operator<(const query q) const {
    return pair<int, int>(L / M, R) < pair<int, int>(q.L / M, q.R);
  }
};
vector<query> Q[111];
int mul[200200];
int ans[200200];
int inv[200200];
int tot[200200];
int C;
int kcnt[200200];
void add(int tp) {
  C = (long long)C * (kcnt[tp] - tot[tp]) % mod;
  tot[tp]++;
}
void del(int tp) {
  tot[tp]--;
  C = (long long)C * inv[kcnt[tp] - tot[tp]] % mod;
}
int Inv(int a) {
  if (a < 2) return a;
  return (long long)mod / a * (mod - Inv(mod % a)) % mod;
}
template <class T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T1, class T2>
inline void gn(T1 &x1, T2 &x2) {
  gn(x1), gn(x2);
}
int main() {
  for (int i = 1; i < 200200; i++) {
    inv[i] = Inv(i);
  }
  int n, m, q;
  gn(n), gn(m), gn(q);
  for (int i = 1; i <= n; i++) {
    gn(e[i]);
    cnt[e[i]]++;
  }
  for (int i = 0; i < q; i++) {
    int L, R, k;
    gn(L), gn(R), gn(k);
    if (flag[k] == 0) {
      flag[k] = ++cur;
      kval[cur] = k;
    }
    Q[flag[k]].push_back(query(L, R, i));
  }
  M = (int)sqrt(n * 2) + 1;
  for (int i = 1; i <= cur; i++) {
    int L = (long long)kval[i] * m % mod;
    mul[n] = 1;
    for (int j = n; --j;) {
      L++;
      mul[j] = (long long)mul[j + 1] * L % mod;
    }
    for (int j = 1; j <= m; j++) kcnt[j] = cnt[j] + kval[i];
    C = 1;
    for (int j = 1; j <= m; j++) tot[j] = 0;
    vector<query> Q = ::Q[i];
    sort(Q.begin(), Q.end());
    int curL = 1, curR = 0;
    for (int i = 0; i < Q.size(); i++) {
      int L = Q[i].L, R = Q[i].R;
      while (L < curL) add(e[--curL]);
      while (R > curR) add(e[++curR]);
      while (L > curL) del(e[curL++]);
      while (R < curR) del(e[curR--]);
      ans[Q[i].id] = (long long)C * mul[R - L + 1] % mod;
    }
  }
  for (int i = 0; i < q; i++) printf("%d\n", ans[i]);
  return 0;
}