I

#include <cstdio>
#include <algorithm>
using namespace std;

int arr[100001];

int main() {

    int t, k, n, i, a, b, q;

    scanf("%d", &t);
    for(k = 1; k <= t; k++)
    {
        scanf("%d%d",&n,&q);
        for(i = 0; i < n; i++)
        {
            scanf("%d",arr+i);
        }

        printf("Case %d:\n", k);
        while(q--) {
            scanf("%d %d", &a, &b);
            a = lower_bound(arr, arr + n, a) - arr;
            b = upper_bound(arr + a, arr + n, b) - arr;
            printf("%d\n", b - a);
        }
    }
    return 0;
}