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

int main() {
    int r, c;
    double p;
    cin >> r >> c >> p;
    double dp[r][c];
    dp[r - 1][c - 1] = 0;
    for (int i = r - 1; i >= 0; i--) {
        for (int j = c - 1; j >= 0; j--) {
            if (i == r - 1 && j == c - 1) continue;
            double di = (i == r - 1) ? (1 << 30) : dp[i + 1][j];
            double dj = (j == c - 1) ? (1 << 30) : dp[i][j + 1];
            double t = min(p, max((double)0, dj - di));
            double ans = t * t / 2 + t * di + (p - t) * dj;

            t = min(p, max((double)0, di - dj));
            ans += t * t / 2 + t * dj + (p - t) * di;
            dp[i][j] = ans / 2 / p;
        }
    }

    cout << dp[0][0] << endl;
}