import java.io.BufferedReader
import java.io.InputStream
import java.io.InputStreamReader
import java.util.*
import kotlin.math.abs
import kotlin.math.max
import kotlin.math.min

val MOD = 998244353L

fun lowerBound(A: IntArray, s: Int, x: Int): Int {
  var l = s - 1
  var h = A.size
  while(h - l > 1) {
    val m = (h + l) / 2
    if (A[m] >= x) h = m
    else l = m
  }
  return h
}
class Solver(stream: InputStream, private val out: java.io.PrintWriter) {
  fun solve() {
    val N = ni()
    val Q = ni()
    val A = na(N)
    A.sort()

    val cumMul = LongArray(N + 1)
    cumMul[0] = 1
    for (i in 0 until N) {
      cumMul[i + 1] = cumMul[i] * A[i] % MOD
    }

    val dp = Array(N + 1) {IntArray(N + 1)}
    dp[0][0] = 1
    var best = LongArray(N + 1)
    best[0] = 1
    var next = LongArray(N + 1)
    for (i in 0 until N) {
      Arrays.fill(next, 0)
      for (j in 0 .. N) {
        if (j + 1 <= N) next[j + 1] += best[j]
        next[j] += best[j] * (A[N - 1 - i] - 1)
      }
      for (j in 0..N) {
        next[j] %= MOD
      }

      for (j in 0..N) {
        dp[i + 1][j] = (next[j] * cumMul[N - 1 - i] % MOD).toInt()
      }

      val t = best
      best = next
      next = t
    }

//    debugDim(dp)

    for (q in 0 until Q) {
      val l = ni()
      val r = ni()
      val p = ni()
      var x = 0
      for (a in l..r) {
        val cnt = lowerBound(A, 0, a)
//        debug{"q:$q a:$a cnt:$cnt"}
        x = x xor dp[N - cnt][p]
      }
      out.println(x % MOD)
    }
  }













































  private val isDebug = try {
    // なんか本番でエラーでる
    System.getenv("MY_DEBUG") != null
  } catch (t: Throwable) {
    false
  }

  private var tokenizer: StringTokenizer? = null
  private val reader = BufferedReader(InputStreamReader(stream), 32768)
  private fun next(): String {
    while (tokenizer == null || !tokenizer!!.hasMoreTokens()) {
      tokenizer = StringTokenizer(reader.readLine())
    }
    return tokenizer!!.nextToken()
  }

  private fun ni() = next().toInt()
  private fun nl() = next().toLong()
  private fun ns() = next()
  private fun na(n: Int, offset: Int = 0): IntArray {
    return map(n) { ni() + offset }
  }
  private fun nal(n: Int, offset: Int = 0): LongArray {
    val res = LongArray(n)
    for (i in 0 until n) {
      res[i] = nl() + offset
    }
    return res
  }

  private fun na2(n: Int, offset: Int = 0): Array<IntArray> {
    val a  = Array(2){IntArray(n)}
    for (i in 0 until n) {
      for (e in a) {
        e[i] = ni() + offset
      }
    }
    return a
  }

  private inline fun map(n: Int, f: (Int) -> Int): IntArray {
    val res = IntArray(n)
    for (i in 0 until n) {
      res[i] = f(i)
    }
    return res
  }

  private inline fun debug(msg: () -> String) {
    if (isDebug) System.err.println(msg())
  }

  private fun debug(a: LongArray) {
    debug { a.joinToString(" ") }
  }

  private fun debug(a: IntArray) {
    debug { a.joinToString(" ") }
  }

  private fun debug(a: BooleanArray) {
    debug { a.map { if (it) 1 else 0 }.joinToString("") }
  }

  private fun debugDim(A: Array<LongArray>) {
    if (isDebug) {
      for (a in A) {
        debug(a)
      }
    }
  }
  private fun debugDim(A: Array<IntArray>) {
    if (isDebug) {
      for (a in A) {
        debug(a)
      }
    }
  }

  /**
   * 勝手にimport消されるのを防ぎたい
   */
  private fun hoge() {
    min(1, 2)
    max(1, 2)
    abs(-10)
  }
}

fun main() {
  val out = java.io.PrintWriter(System.out)
  Solver(System.`in`, out).solve()
  out.flush()
}