use std::io::*;
const MOD: usize = 998244353;

fn lower_bound<T: PartialOrd>(x: T, a: &Vec<T>) -> usize {
    let mut l: usize = 0;
    let mut r: usize = a.len();
    while r != l {
        let mid = (l + r) >> 1;
        if a[mid] < x {
            l = mid + 1;
        } else {
            r = mid;
        }
    }
    l
}

fn main() {
    let mut s: String = String::new();
    std::io::stdin().read_to_string(&mut s).ok();
    let mut itr = s.trim().split_whitespace();
    let n: usize = itr.next().unwrap().parse().unwrap();
    let q: usize = itr.next().unwrap().parse().unwrap();
    let mut a: Vec<usize> = (0..n)
        .map(|_| itr.next().unwrap().parse().unwrap())
        .collect();
    a.sort();
    // aをにぶたんすることで、l ~ rの数字iに対して
    //

    let mut mul: Vec<usize> = vec![1; n + 1];
    let mut dp: Vec<Vec<usize>> = vec![vec![0; n + 1]; n + 1];
    for i in 0..n {
        mul[i + 1] = mul[i] * a[i] % MOD;
    }

    a.reverse();
    dp[0][0] = 1;
    for i in 0..n {
        for j in 0..n {
            dp[i + 1][j + 1] += dp[i][j];
            dp[i + 1][j + 1] %= MOD;
            dp[i + 1][j] += dp[i][j] * (a[i] - 1);
            dp[i + 1][j] %= MOD;
        }
    }
    a.reverse();

    let mut out = Vec::new();
    for _ in 0..q {
        let l: usize = itr.next().unwrap().parse().unwrap();
        let r: usize = itr.next().unwrap().parse().unwrap();
        let p: usize = itr.next().unwrap().parse().unwrap();
        let mut xor = 0;
        for i in l..r + 1 {
            let j = lower_bound(i, &a);
            xor ^= mul[j] * dp[n - j][p] % MOD;
        }
        writeln!(out, "{}", xor).ok();
    }
    stdout().write_all(&out).unwrap();
}