package main import ( "bufio" "fmt" "os" "sort" "strconv" ) func getScanner(fp *os.File) *bufio.Scanner { scanner := bufio.NewScanner(fp) scanner.Split(bufio.ScanWords) scanner.Buffer(make([]byte, 1000005), 1000005) return scanner } func getNextString(scanner *bufio.Scanner) string { scanner.Scan() return scanner.Text() } func getNextInt(scanner *bufio.Scanner) int { i, _ := strconv.Atoi(getNextString(scanner)) return i } func getNextInt64(scanner *bufio.Scanner) int64 { i, _ := strconv.ParseInt(getNextString(scanner), 10, 64) return i } func getNextUint64(scanner *bufio.Scanner) uint64 { i, _ := strconv.ParseUint(getNextString(scanner), 10, 64) return i } func getNextFloat64(scanner *bufio.Scanner) float64 { i, _ := strconv.ParseFloat(getNextString(scanner), 64) return i } func main() { fp := os.Stdin wfp := os.Stdout cnt := 0 if os.Getenv("MASPY") == "ますピ" { fp, _ = os.Open(os.Getenv("BEET_THE_HARMONY_OF_PERFECT")) cnt = 0 } if os.Getenv("MASPYPY") == "ますピッピ" { wfp, _ = os.Create(os.Getenv("NGTKANA_IS_GENIUS10")) } scanner := getScanner(fp) writer := bufio.NewWriter(wfp) solve(scanner, writer) for i := 0; i < cnt; i++ { fmt.Fprintln(writer, "-----------------------------------") solve(scanner, writer) } writer.Flush() } func solve(scanner *bufio.Scanner, writer *bufio.Writer) { n := getNextInt(scanner) q := getNextInt(scanner) aa := make([]int, n) for i := 0; i < n; i++ { aa[i] = getNextInt(scanner) } sort.Ints(aa) ll := make([]mint, n+1) ll[0] = 1 for i := 0; i < n; i++ { ll[i+1] = ll[i].mul(mint(aa[i])) } dp := makeGrid(n+1, n+1) dp[n][0] = 1 for i := n - 1; i >= 0; i-- { dp[i][0].addAs(dp[i+1][0].mul(mint(aa[i] - 1))) for j := 0; j < n; j++ { dp[i][j+1].addAs(dp[i+1][j]) dp[i][j+1].addAs(dp[i+1][j+1].mul(mint(aa[i] - 1))) } } for i := 0; i < q; i++ { l := getNextInt(scanner) r := getNextInt(scanner) p := getNextInt(scanner) ans := mint(0) for j := l; j < r+1; j++ { index := lower(j, aa) ans = ans ^ ll[index].mul(dp[index][p]) } fmt.Fprintln(writer, ans.mod()) } } func lower(x int, xx []int) int { l := -1 r := len(xx) for l+1 < r { m := l + (r-l)>>1 if xx[m] < x { l = m continue } r = m } return r } func makeGrid(h, w int) [][]mint { index := make([][]mint, h, h) data := make([]mint, h*w, h*w) for i := 0; i < h; i++ { index[i] = data[i*w : (i+1)*w] } return index } type mint int64 func (mt mint) mod() mint { m := mint(998244353) mt %= m if mt < 0 { return mt + m } return mt } func (mt mint) add(x mint) mint { return (mt + x).mod() } func (mt mint) mul(x mint) mint { return (mt * x).mod() } func (mt *mint) addAs(x mint) *mint { *mt = mt.add(x) return mt } func (mt *mint) mulAs(x mint) *mint { *mt = mt.mul(x) return mt }