#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long ll;
const int N = 1005;
int main() {
int n, m, K, cas, T = 0, x;
scanf("%d", &cas);
while (cas-->0) {
double sum = 0;
scanf("%d%d%d", &n, &m, &K);
for (int i = 0; i < n; ++i) {
scanf("%d", &x);
sum += x;
}
printf("Case %d: %.5f\n", ++T, sum * m / n);
}
return 0;
}