#include <bits/stdc++.h>
using namespace std;
double dp[210][256][251][2];
int X, K, P;
double p, q;
int main() {
  scanf("%d%d%d", &X, &K, &P);
  p = double(P) / 100.0;
  q = 1 - p;
  memset(dp, 0, sizeof(dp));
  if (X < 256)
    dp[0][X][0][0] = 1;
  else {
    int x = X / 256, i;
    if (x % 2 == 0) {
      for (i = 0; x % 2 == 0; i++, x /= 2)
        ;
      dp[0][X % 256][i][0] = 1;
    } else {
      for (i = 0; x % 2 == 1; i++, x /= 2)
        ;
      dp[0][X % 256][i][1] = 1;
    }
  }
  for (int i = 0; i < K; i++) {
    for (int j = 0; j <= 255; j++)
      for (int l = 0; l <= 250; l++)
        for (int k = 0; k < 2; k++) {
          if (j & (1 << 7)) {
            if (k)
              dp[i + 1][(j * 2) % 256][l + 1][k] += p * dp[i][j][l][k];
            else
              dp[i + 1][(j * 2) % 256][1][1] += p * dp[i][j][l][k];
          } else {
            if (k)
              dp[i + 1][(j * 2) % 256][1][0] += p * dp[i][j][l][k];
            else if (l)
              dp[i + 1][(j * 2) % 256][l + 1][0] += p * dp[i][j][l][k];
            else
              dp[i + 1][(j * 2) % 256][0][0] = p * dp[i][j][l][k];
          }
          if (j < 255)
            dp[i + 1][j + 1][l][k] += q * dp[i][j][l][k];
          else if (k)
            dp[i + 1][0][l][0] += q * dp[i][j][l][k];
          else
            dp[i + 1][0][1][1] += q * dp[i][j][l][k];
        }
  }
  double ans = 0;
  for (int i = 0; i <= 255; i++)
    for (int j = 0; j <= 250; j++)
      for (int k = 0; k < 2; k++) {
        int num = 0;
        int temp = i, t = 0;
        while (temp % 2 == 0 && t++ <= 7) {
          num++;
          temp /= 2;
        }
        if (temp == 0 && k == 0) num += j;
        ans += num * dp[K][i][j][k];
      }
  printf("%.13lf\n", ans);
  return 0;
}
