#include<bits/stdc++.h>
#define ld long double
#define eps 1e-8
using namespace std;
void rd(){}
template<typename T,typename... U> void rd(T &x,U&... arg){
	x=0;int f=1;char c=getchar();
	while(c<'0'||c>'9'){if(c=='-') f=-1;c=getchar();}
	while(c>='0'&&c<='9') x=x*10+c-48,c=getchar();
	x*=f;rd(arg...);
}
const int maxn=505;
const ld inf=1e15;
template<typename T> inline T ABS(T n){return max(n,-n);}
inline int dcmp(ld a,ld b){return a<b-eps?-1:a>b+eps?1:0;}
int N,X,Y;
ld C,__a[maxn],__b[maxn],xl[maxn],yl[maxn];
struct Point{
	ld x,y;Point(ld x=0,ld y=0):x(x),y(y){}
	friend bool operator<(Point a,Point b){
		return dcmp(a.x,b.x)==-1||
		(dcmp(a.x,b.x)==0&&dcmp(ABS(a.y),ABS(b.y))==-1);
	}
}f[maxn][maxn][2];
struct ikun{ld a,b;ikun(ld a=0,ld b=0):a(a),b(b){}}x[maxn],y[maxn];
inline bool cmp(ikun x,ikun y){return ABS(x.a)!=ABS(y.a)?ABS(x.a)>ABS(y.a):ABS(x.b)>ABS(y.b);}
inline Point Cross(ikun x,ikun y){ld __x=(y.a-x.a)/(x.b-y.b);return Point(__x,__x*x.b+x.a);}
ikun q[maxn];
void func(ikun *arr,int &n,ld *lf){
	if(!n) return;
	sort(arr+1,arr+n+1,cmp);
	int p=1;q[1]=arr[1],lf[1]=0;
	for(int i=2;i<=n;i++){
		if(ABS(arr[i].b)<=ABS(q[p].b)+eps) continue;
		Point c=Cross(q[p],arr[i]);
		while(p>1&&lf[p]>=c.x-eps) c=Cross(q[--p],arr[i]);
		q[++p]=arr[i],lf[p]=c.x;
	}
	n=p;
	reverse(q+1,q+p+1);
	reverse(lf+1,lf+p+1);
	for(int i=1;i<=p;i++) arr[i]=q[i];
}
void solve(){
	rd(C,N);
	for(int i=1;i<=N;i++) rd(__a[i]);
	for(int i=1;i<=N;i++) rd(__b[i]);
	X=Y=0;
	for(int i=1;i<=N;i++)
		if(__a[i]>0) x[++X]=ikun(__a[i],__b[i]);
		else y[++Y]=ikun(__a[i],-__b[i]);
	func(x,X,xl);
	func(y,Y,yl);
	for(int i=0;i<=X;i++)
		for(int j=0;j<=Y;j++)
			f[i][j][0]=f[i][j][1]=Point(inf,0);
	f[0][0][0]=f[0][0][1]=Point(0,0);
	for(int i=0;i<=X;i++)
		for(int j=0;j<=Y;j++){
			if(i<X)
				for(int k=0;k<2;k++)
					if(f[i][j][k].x<inf){
						Point c=Cross(x[i+1],ikun(f[i][j][k].y-f[i][j][k].x*C,C));
						if(dcmp(c.x,xl[i+1])!=-1) f[X][j][0]=min(c,f[X][j][0]);
						else f[i+1][j][0]=min(c,f[i+1][j][0]);
					}
			if(j<Y)
				for(int k=0;k<2;k++)
					if(f[i][j][k].x<inf){
						Point c=Cross(y[j+1],ikun(f[i][j][k].y+f[i][j][k].x*C,-C));
						if(dcmp(c.x,yl[j+1])!=-1) f[i][Y][1]=min(c,f[i][Y][1]);
						else f[i][j+1][1]=min(c,f[i][j+1][1]);
					}
		}
	printf("%.9Lf\n",min(f[X][Y][0],f[X][Y][1]).x);
}
int main(){
//	freopen("tiii.in","r",stdin);
//	freopen("ex_tiii4.in","r",stdin);
//	freopen("tiii.out","w",stdout);
	int T;rd(T);
	for(int i=1;i<=T;i++)
		printf("Case #%d: ",i),solve();
//	while(T--) solve();
	return 0;
}