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