#include<bits/stdc++.h>
using namespace std;

typedef long long int ll;
#define IOS ios_base::sync_with_stdio(0);  cin.tie(0); cout.tie(0);

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>order_set;
typedef pair<int, int>pr;
#define all(i)     i.begin() , i.end()
#define ft     first
#define sn     second
#define pb push_back

#define totalone(mask) __builtin_popcount(mask)
#define chkbit(mask,bit) (mask&(1LL << bit))
#define setbit(mask,bit) (mask|(1LL << bit))
#define cngbit(mask,bit) (mask^(1LL << bit))

#define en "\n"
#define dbg(x) cerr<<#x<<" is : "<<x<<en;
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define report cout<<-1<<en
#define sum(n) ((1LL*(n)*(n+1))/ 2LL)
#define sqr(n) (1LL*(n)*(n))
#define vag(a,b) ((a + b - 1)/b)
#define coutv(v) for(auto i: v) cout<<i<<" ";cout<<en;
#define cinv(v) for(auto &i: v) cin >> i;

#define MAXN 50010
#define inf 1e6+5
const int mod = 1e9 + 7;

vector<int>mn, mx;
struct segment_tree
{
    struct node {
        int suru , ses;
        vector<int>v;

        void init(int l, int r) {
            v.clear();
            suru = l, ses = r;
            for (int i = l; i <= r; i++) v.pb(mn[i]);
            sort(all(v));
        }
    } g[4 * MAXN];


    void build(int cn, int l, int r)
    {
        g[cn].init(l, r);

        if (l == r ) return;
        int md = l + (r - l) / 2;

        build(cn * 2, l, md);
        build(cn * 2 + 1, md + 1, r);
    }

    int query(int cn, int l, int r, int val)
    {
        int x = g[cn].suru;
        int y = g[cn].ses;
        if (y < l || x > r) return 0;

        if (l <= x && r >= y ) {
            // coutv(g[cn].v);
            int lb = upper_bound(all(g[cn].v), val) - g[cn].v.begin();
            return  lb;
        }

        int ans = query(cn * 2, l, r, val);
        ans +=  query(cn * 2 + 1, l, r, val);
        return ans;
    }

} stre;


void solve()
{
    int n, q;
    cin >> n >> q;

    vector<pair<int, int>>v;

    mn.clear();
    mx.clear();

    for (int i = 0; i < n; i++) {
        int x, y;
        cin >> x >> y;
        v.pb({y, x});
        mx.pb(y);
    }

    sort(all(mx));
    sort(all(v));

    for (int i = 0; i < n; i++) {
        mn.pb(v[i].sn);
    }

    stre.build(1, 0, n - 1);

    while (q--)
    {
        int x;
        cin >> x;

        int lb = lower_bound(all(mx), x) - mx.begin();
        if (lb == n) cout << 0 << en;
        else
            cout << stre.query(1, lb, n - 1, x) << en;

    }


}
int main()
{
    IOS;
    ll t;
    t = 1;
    cin >> t;

    int c = 0;
    while ( t-- )
    {
        cout << "Case " << ++c << ":\n";
        solve();
    }
    return 0;
}