#include<cstdio>

#include<cstring>

#include<cstdlib>

#include<cctype>

#include<cmath>

#include<iostream>

#include<sstream>

#include<iterator>

#include<algorithm>

#include<string>

#include<vector>

#include<set>

#include<map>

#include<stack>

#include<deque>

#include<queue>

#include<list>

#define lowbit(x) (x & (-x))

const double eps = 1e-8;

inline int dcmp(double a, double b){

    if(fabs(a - b) < eps) return 0;

    return a > b ? 1 : -1;

}

typedef long long LL;

typedef unsigned long long ULL;

const int INT_INF = 0x3f3f3f3f;

const int INT_M_INF = 0x7f7f7f7f;

const LL LL_INF = 0x3f3f3f3f3f3f3f3f;

const LL LL_M_INF = 0x7f7f7f7f7f7f7f7f;

const int dr[] = {0, 0, -1, 1, -1, -1, 1, 1};

const int dc[] = {-1, 1, 0, 0, -1, 1, -1, 1};

const int MOD = 1e9 + 7;

const double pi = acos(-1.0);

const int MAXN = 62500 + 10;

const int MAXT = 100000 + 10;

using namespace std;

int a[MAXN], b[MAXN], dp[MAXN];

map<int, int> mp;

int main(){

    int T;

    scanf("%d", &T);

    int kase = 0;

    while(T--){

        mp.clear();

        int n, p, q;

        scanf("%d%d%d", &n, &p, &q);

        for(int i = 1; i <= p + 1; ++i){

            scanf("%d", &a[i]);

            mp[a[i]] = i;

        }

        for(int i = 1; i <= q + 1; ++i){

            scanf("%d", &b[i]);

            if(!mp.count(b[i])){

                b[i] = 0;

            }

            else{

                b[i] = mp[b[i]];

            }

        }

        memset(dp, INT_INF, sizeof dp);

        for(int i = 1; i <= q + 1; ++i){

            *lower_bound(dp, dp + q + 1, b[i]) = b[i];

        }

        printf("Case %d: %d\n", ++kase, lower_bound(dp, dp + q + 1, INT_INF) - dp);

    }

    return 0;

}