#include <bits/stdc++.h>
using namespace std;
int x, k;
double p, p1;
double f[300][300];
int main() {
  scanf("%d%d%lf", &x, &k, &p);
  p /= 100, p1 = 1.0 - p;
  for (int i = 0; i <= k; i++)
    for (int j = x + i; j % 2 == 0; j /= 2) f[0][i]++;
  for (int i = 0; i < k; i++)
    for (int j = 0; j <= k; j++) {
      if (j) f[i + 1][j - 1] += p1 * f[i][j];
      if (j * 2 <= k) f[i + 1][j * 2] += p * (f[i][j] + 1);
    }
  printf("%.10f\n", f[k][0]);
  return 0;
}
