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