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