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

const int MXN = 505;
const double INF = 1e18;
int T, C, N, aid, bid;
int pos[MXN], spd[MXN], aps[MXN], bps[MXN];
double mnt[MXN][MXN][2], ans;

inline double gettime(double cur, double p, int tgt) {
//cout << "gettime " << cur << ' ' << p << ' ' << tgt << ' ';
  int v(pos[tgt] > 0 ? C : -C);
//cout << (pos[tgt] - p + cur * 1.0 * s) / (s - spd[tgt]) << endl;
  return (p - pos[tgt] - cur * v) / (spd[tgt] - v);
}
inline double getpos(int id, double t) {
  return pos[id] + t * spd[id];
}
inline pair<double, double> getlst(double cur, double p, int id) {
  int v(pos[id] < 0 ? C : -C);
  double tim = (p - pos[id] - cur * v) / (spd[id] - v);
  return make_pair(tim, getpos(id, tim));
}

int main() {
  scanf("%d", &T);
  for (int caseid(1); caseid <= T; ++caseid) {
    scanf("%d%d", &C, &N), aid = bid = 0;
    for (int i(0); i != N; ++i) {
      scanf("%d", &pos[i]);
      if (pos[i] > 0) aps[aid++] = i;
      else bps[bid++] = i;
    }
    for (int i(0); i != N; ++i) {
      scanf("%d", &spd[i]);
      if (pos[i] < 0) spd[i] = -spd[i];
    }
    sort(aps, aps + aid, [](int x, int y) { return spd[x] > spd[y]; });
    sort(bps, bps + bid, [](int x, int y) { return spd[x] < spd[y]; });
    for (int i(0); i <= aid; ++i)
      for (int j(0); j <= bid; ++j) mnt[i][j][0] = mnt[i][j][1] = INF;
    ans = INF;
    mnt[0][0][0] = mnt[0][0][1] = 0;
    for (int i(0); i <= aid; ++i) {
      for (int j(0); j <= bid; ++j) {
//      cout << i << ' ' << j << " 0: " << mnt[i][j][0] << endl;
//      cout << i << ' ' << j << " 1: " << mnt[i][j][1] << endl;
        if (mnt[i][j][0] != INF) {
//        cout << i << ' ' << j << " 0:" << mnt[i][j][0] << endl;
          double curpos(i ? getpos(aps[i - 1], mnt[i][j][0]) : 0);
          bool lok(true), rok(true);
          for (int k(i); k != aid; ++k) {
            if (getpos(aps[k], mnt[i][j][0]) <= curpos) continue;
            mnt[k + 1][j][0] = min(mnt[k + 1][j][0],
                gettime(mnt[i][j][0], curpos, aps[k]));
            lok = false;
            break;
          }
          pair<double, double> lst(j ? getlst(mnt[i][j][0], curpos, bps[j - 1]) :
                                       make_pair(0.0, 0.0));
          for (int k(j); k != bid; ++k) {
            if (getpos(bps[k], lst.first) >= lst.second) continue;
            mnt[i][k + 1][1] = min(mnt[i][k + 1][1],
                gettime(mnt[i][j][0], curpos, bps[k]));
            rok = false;
            break;
          }
          if (lok && rok) ans = min(ans, mnt[i][j][0]);
        }

        if (mnt[i][j][1] != INF) {
//        cout << i << ' ' << j << " 1:" << mnt[i][j][1] << endl;
          double curpos = (j ? getpos(bps[j - 1], mnt[i][j][1]) : 0);
          bool lok = true, rok = true;
          for (int k(j); k != bid; ++k) {
            if (getpos(bps[k], mnt[i][j][1]) >= curpos) continue;
            mnt[i][k + 1][1] = min(mnt[i][k + 1][1],
                gettime(mnt[i][j][1], curpos, bps[k]));
            rok = false;
            break;
          }
          pair<double, double> lst(i ? getlst(mnt[i][j][1], curpos, aps[i - 1]) :
                                       make_pair(0.0, 0.0));
          for (int k(i); k != aid; ++k) {
            if (getpos(aps[k], lst.first) <= lst.second) continue;
            mnt[k + 1][j][0] = min(mnt[k + 1][j][0],
                gettime(mnt[i][j][1], curpos, aps[k]));
            lok = false;
            break;
          }
          if (lok && rok) ans = min(ans, mnt[i][j][1]);
        }
      }
    }
    printf("Case #%d: %.9lf\n", caseid, ans);
  }
  return 0;
}