#include <bits/stdc++.h>
double f[300][300];
int i, j, m, n, p;
int main() {
  scanf("%d%d%d", &m, &n, &p);
  for (i = 0; i <= n; i++)
    for (j = m + i; (!(j & 1)); j = j >> 1) f[0][i] = f[0][i] + 1;
  for (i = 0; i < n; i++)
    for (j = 0; j <= n; j++) {
      if (j > 0) f[i + 1][j - 1] = f[i + 1][j - 1] + f[i][j] * (1 - p / 100.0);
      if (j * 2 <= n)
        f[i + 1][2 * j] = f[i + 1][2 * j] + (f[i][j] + 1) * (p / 100.0);
    }
  printf("%.10lf", f[n][0]);
  return 0;
}
