543_E. Listening to Music_10301
Please note that the memory limit differs from the standard.

You really love to listen to music. During the each of next s days you will listen to exactly m songs from the playlist that consists of exactly n songs. Let's number the songs from the playlist with numbers from 1 to n, inclusive. The quality of song number i is ai.

On the i-th day you choose some integer v (li ≤ v ≤ ri) and listen to songs number v, v + 1, ..., v + m - 1. On the i-th day listening to one song with quality less than qi increases your displeasure by exactly one.

Determine what minimum displeasure you can get on each of the s next days. 

Input

The first line contains two positive integers n, m (1 ≤ m ≤ n ≤ 2·105). The second line contains n positive integers a1, a2, ..., an (0 ≤ ai < 230) — the description of songs from the playlist. 

The next line contains a single number s (1 ≤ s ≤ 2·105) — the number of days that you consider.

The next s lines contain three integers each li, ri, xi (1 ≤ li ≤ ri ≤ n - m + 1; 0 ≤ xi < 230) — the description of the parameters for the i-th day. In order to calculate value qi, you need to use formula: <image>, where ansi is the answer to the problem for day i. Assume that ans0 = 0. 

Output

Print exactly s integers ans1, ans2, ..., anss, where ansi is the minimum displeasure that you can get on day i.

Examples

Input

5 3
1 2 1 2 3
5
1 1 2
1 3 2
1 3 3
1 3 5
1 3 1


Output

2
0
2
3
1
#include <bits/stdc++.h>
using namespace std;
int read() {
  int X = 0, w = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') w = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') X = X * 10 + c - '0', c = getchar();
  return X * w;
}
const int N = 200000 + 10, M = 447 + 10;
int n, m, Q, a[N], id[N];
bool cmp(int x, int y) { return a[x] > a[y]; }
int B, bl[N], L[M], R[M], w[N], addv[M], maxv[M];
int omaxv[M][M], lw[M][M], ql[N], qr[N], qlmax[N], qrmax[N];
int query(int l, int r, int w, int x) {
  int res = 0;
  for (int i = L[bl[l]]; i < l; ++i) w += (a[i + m] >= x) - (a[i] >= x);
  for (int i = l; i <= r; ++i)
    res = max(res, w), w += (a[i + m] >= x) - (a[i] >= x);
  return res;
}
int main() {
  n = read(), m = read();
  B = sqrt(n);
  for (int i = 1; i <= n; ++i) a[i] = read(), id[i] = i;
  sort(id + 1, id + n + 1, cmp);
  for (int i = 1; i <= n; ++i) bl[i] = (i - 1) / B + 1;
  for (int i = 1; i <= bl[n]; ++i) L[i] = (i - 1) * B + 1, R[i] = min(i * B, n);
  for (int i = 1; i <= n; ++i) {
    int l = ql[i] = max(1, id[i] - m + 1), r = qr[i] = id[i];
    if (bl[i] != bl[i - 1]) {
      for (int j = 1; j <= n; ++j) w[j] += addv[bl[j]];
      for (int j = 1; j <= bl[n]; ++j)
        omaxv[bl[i]][j] = maxv[j], lw[bl[i]][j] = w[L[j]], addv[j] = 0;
    }
    if (bl[l] == bl[r]) {
      for (int j = l; j <= r; ++j)
        ++w[j], maxv[bl[j]] = max(maxv[bl[j]], w[j] + addv[bl[j]]);
      qlmax[i] = max(qlmax[i], maxv[bl[l]]);
    } else {
      for (int j = l; j <= R[bl[l]]; ++j)
        ++w[j], maxv[bl[j]] = max(maxv[bl[j]], w[j] + addv[bl[j]]);
      for (int j = L[bl[r]]; j <= r; ++j)
        ++w[j], maxv[bl[j]] = max(maxv[bl[j]], w[j] + addv[bl[j]]);
      for (int j = bl[l] + 1; j <= bl[r] - 1; ++j) ++addv[j], ++maxv[j];
      for (int j = L[bl[l]]; j <= R[bl[l]]; ++j) qlmax[i] = max(qlmax[i], w[j]);
      for (int j = L[bl[r]]; j <= R[bl[r]]; ++j) qrmax[i] = max(qrmax[i], w[j]);
    }
  }
  Q = read();
  int lastans = 0;
  while (Q--) {
    int l = read(), r = read(), x = read() ^ lastans;
    a[0] = x;
    int p = upper_bound(id + 1, id + n + 1, 0, cmp) - id - 1;
    for (int i = 1; i <= bl[n]; ++i) addv[i] = 0, maxv[i] = omaxv[bl[p]][i];
    int llw = lw[bl[p]][bl[l]], lrw = lw[bl[p]][bl[r]];
    for (int i = L[bl[p]]; i <= p; ++i) {
      maxv[bl[ql[i]]] = qlmax[i];
      if (bl[ql[i]] != bl[qr[i]])
        maxv[bl[qr[i]]] = qrmax[i], ++addv[bl[ql[i]] + 1], --addv[bl[qr[i]]];
      if (ql[i] <= L[bl[l]] && L[bl[l]] <= qr[i]) ++llw;
      if (ql[i] <= L[bl[r]] && L[bl[r]] <= qr[i]) ++lrw;
    }
    for (int i = 1; i <= bl[n]; ++i) addv[i] += addv[i - 1];
    if (bl[l] == bl[r])
      printf("%d\n", lastans = m - query(l, r, llw, x));
    else {
      int ans = max(query(l, R[bl[l]], llw, x), query(L[bl[r]], r, lrw, x));
      for (int i = bl[l] + 1; i <= bl[r] - 1; ++i)
        ans = max(ans, maxv[i] + addv[i]);
      printf("%d\n", lastans = m - ans);
    }
  }
  return 0;
}

5 3
1 2 1 2 3
5
1 1 2
1 3 2
1 3 3
1 3 5
1 3 1
 1 1
5
3
1 1 4
1 1 5
1 1 6
 2 1
0 1
6
1 1 1
1 1 0
1 1 2
1 2 0
1 2 1
1 2 2
 2 2
1 1
3
1 1 4
1 1 1
1 1 0
 5 2
0 0 0 0 0
2
1 3 0
1 3 1
 1 1
5
3
1 1 4
1 1 5
1 1 4
 2 1
0 1
2
1 1 1
1 1 0
1 1 2
1 2 0
1 2 1
1 2 2
 2 2
1 1
3
1 1 4
1 1 0
1 1 0
 5 2
0 0 0 0 0
2
1 3 0
2 3 1
 5 3
1 2 1 2 3
5
1 1 2
1 3 2
1 1 3
1 3 5
1 3 1
 2 2
1 1
1
1 1 4
1 1 0
1 1 0
 2 1
1 2
1
1 1 4
1 1 0
0 2 -1
 2 1
0 1
6
1 1 1
1 1 0
1 1 2
1 2 0
1 2 1
1 2 0
 5 3
1 2 1 2 3
5
1 1 2
1 3 2
1 3 3
1 3 6
1 3 1
 2 1
0 1
2
1 1 1
1 2 0
1 1 2
1 2 0
1 2 0
1 2 2
 5 3
1 2 2 2 3
5
1 1 2
1 3 2
1 3 3
1 3 6
1 3 1
 1 1
5
3
1 1 4
1 1 5
1 1 2
 2 1
0 1
2
1 1 1
1 1 0
1 1 2
1 2 0
1 2 0
1 2 2
 2 2
0 1
2
1 1 1
1 1 0
1 1 2
1 2 0
1 2 0
1 2 2
 2 2
1 1
1
1 1 4
1 1 0
1 1 -1
 2 2
0 1
2
1 1 1
1 1 0
1 1 0
1 2 0
1 2 0
1 2 2
 2 2
1 1
1
1 1 4
1 1 0
1 1 -2
 2 2
0 1
2
1 1 1
1 1 0
1 1 0
1 2 0
1 2 0
1 0 2
 2 2
1 1
1
1 1 4
1 1 0
2 1 -2
 2 2
0 1
2
1 1 1
1 1 0
1 1 0
1 4 0
1 2 0
1 0 2
 2 2
1 2
1
1 1 4
1 1 0
2 1 -2
 2 2
0 1
2
1 1 1
1 1 0
1 1 0
0 4 0
1 2 0
1 0 2
 2 2
1 2
1
1 1 4
1 1 0
0 1 -2
 2 2
0 2
2
1 1 1
1 1 0
1 1 0
0 4 0
1 2 0
1 0 2
 2 2
1 2
1
1 1 4
1 1 0
0 2 -2
 2 2
1 2
1
1 1 4
1 1 0
0 3 -2
 2 2
1 2
1
1 1 4
1 1 0
0 2 -1
 2 1
1 2
1
1 1 4
1 1 0
0 0 -1
 2 1
1 2
1
1 1 4
1 1 0
1 0 -1
 2 2
1 1
3
1 1 6
1 1 1
1 1 0
 2 1
0 1
2
1 1 1
1 1 0
1 1 2
1 2 0
1 2 1
2 2 2
 1 1
5
3
1 1 1
1 1 5
1 1 2
 2 2
1 1
1
1 1 4
1 1 0
1 0 0
 2 2
0 1
2
1 1 1
1 1 0
1 1 2
1 2 0
1 2 1
1 2 2
 2 2
0 1
1
1 1 1
1 1 0
1 1 0
1 2 0
1 2 0
1 2 2
 2 2
1 1
1
1 1 4
2 1 0
1 1 -2
 2 1
1 1
1
1 1 4
1 1 0
2 1 -2
 2 2
0 1
2
1 1 1
1 1 0
1 1 0
1 4 0
1 2 1
1 0 2
 2 2
1 2
1
1 1 4
1 1 0
2 1 -3
 2 2
0 1
2
1 1 1
1 1 0
1 1 0
0 4 0
1 3 0
1 0 2
 2 2
1 2
1
1 1 4
1 2 0
0 3 -2
 2 1
1 3
1
1 1 4
1 1 0
0 2 -1
 2 1
1 2
1
1 1 4
1 1 -1
0 0 -1
 2 1
1 2
1
1 1 4
1 1 0
1 0 0
 2 1
0 1
6
1 1 1
1 1 0
1 1 2
1 2 0
1 2 1
1 2 -1
 2 1
0 1
2
1 1 1
1 1 0
0 1 2
1 2 0
1 2 1
2 2 2
 2 1
0 1
2
1 1 1
1 2 0
1 1 2
1 2 0
1 2 1
1 2 2
 2 2
1 1
1
1 1 4
1 1 0
2 0 0
 2 2
0 1
1
1 1 1
1 1 0
1 1 0
1 0 0
1 2 0
1 2 2
 2 1
0 1
1
1 1 4
1 1 0
2 1 -2
 2 2
0 1
2
1 1 1
1 1 0
1 1 0
1 4 0
2 2 1
1 0 2
 2 2
1 2
1
1 1 4
1 1 1
2 1 -3
 2 2
0 1
2
1 1 1
1 1 0
1 1 0
0 4 0
1 3 1
1 0 2
 2 2
1 2
1
1 1 4
1 2 0
0 3 0
 2 1
1 3
2
1 1 4
1 1 0
0 2 -1

2
0
2
3
1
 0
0
1
 1
1
1
0
0
1
 2
2
2
 0
2
 0
0
0
 1
1
 2
2
2
 0
2
 2
0
3
3
1
 2
 1
 1
1
1
0
0
0
 2
0
2
3
1
 1
0
 1
2
0
3
0
 0
0
0
 1
1
 1
1
 2
 1
1
 2
 1
1
 2
 1
1
 2
 1
1
 2
 1
1
 2
 2
 2
 1
 1
 2
2
2
 1
1
 0
0
0
 2
 1
1
 1
 2
 1
 1
1
 2
 1
1
 2
 1
 1
 1
 1
1
1
0
0
0
 1
1
 1
0
 2
 1
 1
 1
1
 2
 1
1
 2
 1
0
