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

using ci = const int;

using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;

#define il inline
#define TT template<typename T>

TT il void Max(T &x, const T &y) { if (x < y) x = y; }
TT il void Min(T &x, const T &y) { if (y < x) x = y; }

const int N = 505;

int T, C, n;
double dp[2][N][N];

struct Node {
	int x, v;
} a[N], b[N], c[N];
int n1, n2;

bool cmp(const Node &x, const Node &y) { return x.v < y.v; }

void work() {
	cin >> C >> n;
	n1 = n2 = 0;
	for (int i = 1; i <= n; ++i) cin >> c[i].x;
	for (int i = 1; i <= n; ++i) cin >> c[i].v;
	for (int i = 1; i <= n; ++i) {
		if (c[i].x < 0) a[++n1] = c[i], a[n1].x *= -1;
		else b[++n2] = c[i];
	}

	sort(a + 1, a + 1 + n1, cmp);
	sort(b + 1, b + 1 + n2, cmp);

	memset(dp, 0x77, sizeof dp);
	dp[0][0][0] = dp[1][0][0] = 0;
	for (int i = 0; i <= n1; ++i) {
		for (int j = 0; j <= n2; ++j) {
			double t0 = dp[0][i][j], t1 = dp[1][i][j];
			double pos, mx(0);
			pos = t0 * a[i].v + a[i].x;
			for (int k = i + 1; k <= n1; ++k) {
				Max(mx, t0 + max(a[k].x + a[k].v * t0 - pos, 0.0) / (C - a[k].v));
				Min(dp[0][k][j], mx);
			}
			mx = 0;
			for (int k = j + 1; k <= n2; ++k) {
				Max(mx, t0 + max(b[k].x + b[k].v * t0 + pos, 0.0) / (C - b[k].v));
				Min(dp[1][i][k], mx);
			}
			pos = t1 * b[j].v + b[j].x;
			mx = 0;
			for (int k = i + 1; k <= n1; ++k) {
				Max(mx, t1 + max(a[k].x + a[k].v * t1 + pos, 0.0) / (C - a[k].v));
				Min(dp[0][k][j], mx);
			}
			mx = 0;
			for (int k = j + 1; k <= n2; ++k) {
				Max(mx, t1 + max(b[k].x + b[k].v * t1 - pos, 0.0) / (C - b[k].v));
				Min(dp[1][i][k], mx);
			}

		}
	}
	cout << fixed << setprecision(8) << min(dp[0][n1][n2], dp[1][n1][n2]) << "\n";
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);

	cin >> T;
	for (int i = 1; i <= T; ++i) {
		cout << "Case #" << i << ": ";
		work();
	}

	return 0;
}