1 #include<iostream>
  2 #include<iomanip>
  3 #include<cstring>
  4 #include<cstdio>
  5 #include<string>
  6 #include<cmath>
  7 #include<algorithm>
  8 #include<fstream>
  9 #include<stack>
 10 #include<climits>
 11 #include<queue>
 12 #define eps 1e-7
 13 //#define ll long long
 14 #define inf 0x3f3f3f3f
 15 #define pi 3.141592653589793238462643383279
 16 using namespace std;
 17 const int MAXN = 1e5 + 7;
 18 int n,m,tree[20][MAXN],sorted[MAXN],toleft[20][MAXN];
 19
 20 void build(int l,int r,int dep)  //建立划分树
 21 {
 22     if(l == r) return;
 23
 24     int mid = (l + r)>>1;
 25     int lpos = l;
 26     int rpos = mid + 1;
 27     int same = mid - l + 1;
 28     for(int i=l; i<=r; ++i)
 29         if(tree[dep][i] < sorted[mid])
 30             same--;
 31
 32     for(int i=l; i<=r; ++i)
 33     {
 34         if(tree[dep][i] < sorted[mid])
 35             tree[dep+1][lpos++] = tree[dep][i];
 36         else if(tree[dep][i] == sorted[mid] && same > 0)
 37         {
 38             tree[dep+1][lpos++] = tree[dep][i];
 39             same--;
 40         }
 41         else tree[dep+1][rpos++] = tree[dep][i];
 42         toleft[dep][i] = toleft[dep][l-1] + lpos - l;
 43     }
 44
 45     build(l,mid,dep+1);
 46     build(mid+1,r,dep+1);
 47 }
 48
 49 int query(int l,int r,int L,int R,int dep,int k)  //划分树查询区间第k大值
 50 {
 51     if(l == r)
 52         return tree[dep][l];
 53     int mid = (L + R) >> 1;
 54     int cnt = toleft[dep][r] - toleft[dep][l-1];
 55
 56     int newl,newr;
 57     if(cnt >= k)
 58     {
 59         newl = L + toleft[dep][l-1] - toleft[dep][L-1];
 60         newr = newl + cnt - 1;
 61         return query(newl,newr,L,mid,dep+1,k);
 62     }
 63     else
 64     {
 65         newr = r + (toleft[dep][R] - toleft[dep][r]);
 66         newl = newr - r + l + cnt;
 67         return query(newl,newr,mid+1,R,dep+1,k - cnt);
 68     }
 69 }
 70
 71 int solve(int ll,int rr,int h)    //计算区间当中可以被跳过的砖头的数量
 72 {
 73     int l = 1,r = (rr-ll) + 1,ans=0;
 74     while(l <= r)
 75     {
 76         int mid = (l + r) >> 1;  //取当前区间的中间值下标
 77         if(query(ll,rr,1,n,0,mid) <= h)  //划分树查询得到中间值，若中间值 <= h
 78         {
 79             l = mid + 1; //缩小区间
 80             ans = mid;
 81         }
 82         else r = mid - 1;
 83     }
 84     return ans;
 85 }
 86
 87 int main()
 88 {
 89     int t,cnt = 0;
 90     cin>>t;
 91     while(t--)
 92     {
 93         cin>>n>>m;
 94         for(int i=1; i<=n; ++i)
 95         {
 96             scanf("%d",&sorted[i]);
 97             tree[0][i] = sorted[i];
 98         }
 99         sort(sorted+1, sorted+1+n);
100         build(1,n,0);
101
102         printf("Case %d:\n",++cnt);
103         int l,r,h;
104         while(m--)
105         {
106             scanf("%d%d%d",&l,&r,&h);
107             printf("%d\n",solve(l+1,r+1,h));
108         }
109     }
110     return 0;
111 }