#include<iostream>
#include<cmath>
#include<cstdio>
#include<algorithm>
const double eps=1e-10;using namespace std;struct Point
{double x;double y;Point(double x=0,double y=0):x(x),y(y){}void operator<<(Point &A) {cout<<A.x<<' '<<A.y<<endl;}
};int dcmp(double x)  {return (x>eps)-(x<-eps); }typedef  Point  Vector;Vector  operator +(Vector A,Vector B) { return Vector(A.x+B.x,A.y+B.y);}Vector  operator -(Vector A,Vector B) { return Vector(A.x-B.x,A.y-B.y); }Vector  operator *(Vector A,double p) { return Vector(A.x*p,A.y*p);  }Vector  operator /(Vector A,double p) {return Vector(A.x/p,A.y/p);}// ps  cout

ostream &operator<<(ostream & out,Point & P) { out<<P.x<<' '<<P.y<<endl; return out;}bool  operator< (const Point &A,const Point &B) { return A.x<B.x||(A.x==B.x&&A.y<B.y); }bool  operator== ( const Point &A,const Point &B) { return dcmp(A.x-B.x)==0&&dcmp(A.y-B.y)==0;}double  Dot(Vector A,Vector B) {return A.x*B.x+A.y*B.y;}double  Cross(Vector A,Vector B)  {return A.x*B.y-B.x*A.y; }double  Length(Vector A)  { return sqrt(Dot(A, A));}double DistanceToSegment(Point P , Point A , Point B)
{if(A == B)  return Length(P-A);Vector v1 = B-A ;Vector v2 = P-A ;Vector v3 = P-B ;if(dcmp(Dot(v1,v2)) < 0)  return Length(v2);else if(dcmp(Dot(v1,v3)) > 0) return Length(v3);else return fabs(Cross(v1 , v2))/Length(v1);
}Point  read_point()
{Point P;scanf("%lf%lf",&P.x,&P.y);return  P;
}double Max,Min;const int maxn=60;Point P[maxn],Q[maxn];void update(Point P,Point A,Point B)
{Min=min(Min,DistanceToSegment(P, A,B));Max=max(Max,Length(P-A));Max=max(Max,Length(P-B));}int main()
{int T;int A,B;cin>>T;for(int kase = 1;kase <= T;kase++){cin>>A>>B;for(int i=0;i<A;i++)  P[i]=read_point();for(int i=0;i<B;i++)  Q[i]=read_point();double LenA=0,LenB=0;for(int i=0;i<A-1;i++)  LenA+=Length(P[i+1]-P[i]);for(int i=0;i<B-1;i++)  LenB+=Length(Q[i+1]-Q[i]);int Sa=0,Sb=0;Min= 1e9;Max=-1e9;Point Pa=P[0];Point Pb=Q[0];while(Sa<A-1 && Sb < B-1){double  La=Length(P[Sa+1]-Pa);double  Lb=Length(Q[Sb+1]-Pb);double T=min(La/LenA,Lb/LenB);Vector Va=(P[Sa+1]-Pa)/La*T*LenA;Vector Vb=(Q[Sb+1]-Pb)/Lb*T*LenB;update(Pa,Pb,Pb+Vb-Va);Pa=Pa+Va;Pb=Pb+Vb;if(Pa==P[Sa+1])  Sa++;if(Pb==Q[Sb+1])  Sb++;}printf("Case %d: %.0lf\n",kase,Max -Min);}}