#include <cstdio>

#include <queue>

#include <cstring>

#include <iostream>

#include <cstdlib>

#include <algorithm>

#include <vector>

#include <map>

#include <set>

#include <ctime>

#include <cmath>

#include <cctype>

#define MAX 63000

#define LL long long

using namespace std;

int a[MAX],b,len[MAX],idx[MAX],bi[MAX],T,p,q,m,n,cas=;

int main()

{

    freopen("/home/user/桌面/in","r",stdin);

    scanf("%d",&T);

    while(T--)

    {

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

        scanf("%*d");

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

        {

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

            idx[a[i]]=i;//当a[i]范围很大时可用hash代替

        }

        n=;

        scanf("%*d");

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

        {

            scanf("%d",&b);

            if(a[idx[b]]) bi[++n]=idx[b];

        }

        len[]=bi[];

        int l=;

        for(int i=;i<=n;i++)//求LIS

        {

            if(bi[i]>len[l]) len[++l]=bi[i];

            else *lower_bound(len+,len+l+,bi[i])=bi[i];

        }

        printf("Case %d: %d\n",cas++,l+);

    }

    //printf("time=%.3lf",(double)clock()/CLOCKS_PER_SEC);

    return ;

}