lightoj 1284

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <ctime>
#include <cassert>
#include <queue>

using namespace std;

#define f first
#define s second
#define mp make_pair
#define pb push_back
#define forit(it,con) for (typeof(con.begin()) it = con.begin(); it != con.end(); ++it)
#define f0(a) memset(a, 0, sizeof(a))
#define all(v) v.begin(), v.end()
#define pii pair<int,int>
#define vi vector<int>
#define ll long long
#ifdef WIN32
    #define I64 "%I64d"
#else
    #define I64 "%lld"
#endif
int X, Y, Z, n;
int C[1000][1000];

double getProb(double i, double n) {
    return ((i + 1) * (n - i) * 2 - 1) / (n * n);
}

void Solve() {
    double ans = 0;
    for (int x = 0; x < X; ++x)
        for (int y = 0; y < Y; ++y)
            for (int z = 0; z < Z; ++z) {
                double prob = getProb(x, X) * getProb(y, Y) * getProb(z, Z);
                for (int k = 1; k <= n; k += 2)
                    ans += C[n][k] * pow(prob, k) * pow(1 - prob, n - k);
            }
    printf("%.6lf\n", ans);
}


int main() {
    #ifdef LOCAL
        freopen("in","r",stdin);
        freopen("out","w",stdout);
    #endif
    int tests;
    scanf("%d", &tests);
    C[0][0] = 1;
    for (int i = 1; i <= 100; ++i) {
        C[i][0] = 1;
        for (int j = 1; j <= 100; ++j)
            C[i][j] = C[i - 1][j] + C[i - 1][j - 1];
    }


    for (int test = 1; test <= tests; ++test) {
        scanf("%d%d%d%d", &X, &Y, &Z, &n);
        printf("Case %d: ", test);
        Solve();
    }
    return 0;
}