#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
vector<long long> multiply(vector<long long> A, vector<long long> B){
  int N = A.size();
  int M = B.size();
  vector<long long> C(N + M - 1, 0);
  for (int i = 0; i < N; i++){
    for (int j = 0; j < M; j++){
      C[i + j] += A[i] * B[j];
      C[i + j] %= MOD;
    }
  }
  return C;
}
long long get(vector<long long> A, vector<long long> B, int K){
  int N = A.size();
  int M = B.size();
  long long ans = 0;
  for (int i = 0; i < N; i++){
    int j = K - i;
    if (0 <= j && j < M){
      ans += A[i] * B[j];
      ans %= MOD;
    }
  }
  return ans;
}
struct disjoint_sparse_table{
  vector<vector<long long>> A;
  vector<vector<vector<long long>>> D;
  disjoint_sparse_table(vector<int> &P){
    int N = P.size();
    A.resize(N);
    for (int i = 0; i < N; i++){
      A[i] = {1, P[i] % MOD};
      if (A[i][1] < 0){
        A[i][1] += MOD;
      }
    }
    int LOG = 32 - __builtin_clz(N - 1);
    D = vector<vector<vector<long long>>>(LOG, vector<vector<long long>>(N));
    for (int i = 0; i < LOG; i++){
      int d = 1 << i;
      for (int j = 0; j + d < N; j += d * 2){
        D[i][j + d - 1] = A[j + d - 1];
        for (int k = j + d - 2; k >= j; k--){
          D[i][k] = multiply(A[k], D[i][k + 1]);
        }
        D[i][j + d] = A[j + d];
        for (int k = j + d + 1; k < min(j + d * 2, N); k++){
          D[i][k] = multiply(D[i][k - 1], A[k]);
        }
      }
    }
  }
  long long query(int L, int R, int K){
    R--;
    int b = 31 - __builtin_clz(R ^ L);
    return get(D[b][L], D[b][R], K);
  }
};
int main(){
  int N;
  cin >> N;
  vector<int> P(N);
  for (int i = 0; i < N; i++){
    cin >> P[i];
  }
  disjoint_sparse_table ST(P);
  int Q;
  cin >> Q;
  for (int i = 0; i < Q; i++){
    int A, B, K;
    cin >> A >> B >> K;
    A--;
    cout << ST.query(A, B, K) << endl;
  }
}