1 #include<iostream>
 2 #include<cstdio>
 3 #include<cmath>
 4 #include<cstring>
 5 #include<algorithm>
 6 using namespace std;
 7 const int INF=0x3f3f3f3f;
 8 const double PI=acos(-1);
 9 #define mem(x,y) memset(x,y,sizeof(x))
10 const int MAXN=1e5+100;
11 int s[MAXN],e[MAXN];
12 int main(){
13     int t,M,N,flot=0;
14     scanf("%d",&t);
15     while(t--){
16         scanf("%d%d",&N,&M);
17         for(int i=0;i<N;i++){
18             scanf("%d%d",&s[i],&e[i]);
19         }
20         sort(s,s+N);sort(e,e+N);
21         int q;
22         printf("Case #%d:\n",++flot);
23     //    for(int i=0;i<N;i++)printf("%d ",s[i]);puts("");
24     //    for(int i=0;i<N;i++)printf("%d ",e[i]);puts("");
25         while(M--){
26             scanf("%d",&q);
27             int x=upper_bound(s,s+N,q)-s;
28             int y=lower_bound(e,e+N,q)-e;
29             //printf("%d %d\n",x,y);
30         //    if(e[y-1]==q)y--;
31         //    if(s[x]==q)x++;
32             printf("%d\n",x-y);
33         }
34     }
35     return 0;
36 }