#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <string>
#include <string.h>
#include <algorithm>
using namespace std;
#define LL __int64
#define eps 1e-8
#define lson l , m , rt << 1
#define rson m + 1 , r , rt << 1 | 1
const int MOD = 10000007;
const int maxn = 100000 + 5;
const int N = 15;
struct Node {        //每个节点的信息int h , pos;bool operator < (const Node tmp) const {return h < tmp.h;}
} a[maxn];
struct Section {    //每次查询的区间信息int L , R , H;int index;bool operator < (const Section tmp) const {return H < tmp.H;}
} s[maxn];
int cnt[maxn << 2] , ans[maxn];
void PushUp(int rt)
{cnt[rt] = cnt[rt << 1] + cnt[rt << 1 | 1];
}
void build()
{memset(cnt , 0 , sizeof(cnt));
}
void update(int p , int l , int r , int rt)
{if(l == r) {cnt[rt]++;return;}int m = (l + r) >> 1;if(p > m)        //找到更新点的位置
        update(p , rson);elseupdate(p , lson);PushUp(rt);
}
int query(int L , int R , int l , int r , int rt)
{if(L <= l && R >= r) {return cnt[rt];}int m = (l + r) >> 1;if(L > m)return query(L , R , rson);else if(R <= m)return query(L , R , lson);elsereturn query(L , R , lson) + query(L , R , rson);
}
int main()
{int T , i , j , n , m;cin >> T;for(int k = 1 ; k <= T ; k++){build();printf("Case %d:\n" , k);scanf("%d %d" , &n , &m);for(i = 1 ; i <= n ; i++) {scanf("%d" , &a[i].h);a[i].pos = i;}for(i = 1 ; i <= m ; i++) {scanf("%d %d %d" , &s[i].L , &s[i].R , &s[i].H);s[i].index = i;}sort(a + 1 , a + n + 1);sort(s + 1 , s + m + 1);for(i = j = 1 ; i <= m ; i++) {        //这里就是上面的③while(a[j].h <= s[i].H && j <= n) {update(a[j++].pos , 1 , n , 1);}ans[s[i].index] = query(s[i].L + 1 , s[i].R + 1 , 1 , n , 1);}for(i = 1 ; i <= m ; i++)printf("%d\n" , ans[i]);}return 0;
}