Valera is a coder. Recently he wrote a funny program. The pseudo code for this program is given below:
    
    
      
    //input: integers x, k, p  
    a = x;  
    for(step = 1; step <= k; step = step + 1){  
        rnd = [random integer from 1 to 100];  
        if(rnd <= p)  
            a = a * 2;  
        else  
            a = a + 1;  
    }  
      
    s = 0;  
      
    while(remainder after dividing a by 2 equals 0){  
        a = a / 2;  
        s = s + 1;  
    }  
      
    

Now Valera wonders: given the values x, k and p, what is the expected value of the resulting number s?

Input

The first line of the input contains three integers x, k, p (1 ≤ x ≤ 109; 1 ≤ k ≤ 200; 0 ≤ p ≤ 100).

Output

Print the required expected value. Your answer will be considered correct if the absolute or relative error doesn't exceed 10 - 6.

Examples

Input

1 1 50


Output

1.0000000000000


Input

5 3 0


Output

3.0000000000000


Input

5 3 25


Output

1.9218750000000

Note

If the concept of expected value is new to you, you can read about it by the link: 

http://en.wikipedia.org/wiki/Expected_value
#include <bits/stdc++.h>
using namespace std;
int x, k;
long double dp[2][300][2][300];
long double p;
void pre(int u) {
  if (u < (1 << 8)) {
    dp[0][0][0][u] = 1;
  } else {
    int v = u >> 8;
    int e = u - (v << 8);
    int last = v & 1;
    int d = 1;
    while (((v >> d) & 1) == last) {
      d++;
    }
    dp[0][d][last][e] = 1;
  }
}
int main() {
  cin >> x >> k >> p;
  int cur, next;
  p = 1.0 * p / 100;
  cur = 0;
  pre(x);
  for (int it = 1; it <= k; it++) {
    next = cur ^ 1;
    for (int i = 0; i < 300; i++) {
      for (int j = 0; j < 2; j++) {
        for (int mask = 0; mask < (1 << 8); mask++) {
          dp[next][i][j][mask] = 0;
        }
      }
    }
    for (int i = 0; i < 300; i++) {
      for (int j = 0; j < 2; j++) {
        for (int mask = 0; mask < (1 << 8); mask++) {
          if (abs(dp[cur][i][j][mask]) < 0.0000000000000001) {
            continue;
          }
          int f = (mask >> 7) & 1;
          int e = (mask * 2) % (1 << 8);
          if (i == 0) {
            dp[next][f][f][e] += p * dp[cur][i][j][mask];
          } else {
            if (f == j) {
              dp[next][i + 1][f][e] += p * dp[cur][i][j][mask];
            } else {
              dp[next][1][f][e] += p * dp[cur][i][j][mask];
            }
          }
          if (mask + 1 == (1 << 8)) {
            if (j == 0) {
              dp[next][1][1][0] += (1.0 - p) * dp[cur][i][j][mask];
            } else {
              dp[next][i][0][0] += (1.0 - p) * dp[cur][i][j][mask];
            }
          } else {
            dp[next][i][j][mask + 1] += (1.0 - p) * dp[cur][i][j][mask];
          }
        }
      }
    }
    cur = next;
  }
  long double res = 0;
  for (int i = 0; i < 300; i++) {
    for (int j = 0; j < 2; j++) {
      for (int mask = 0; mask < (1 << 8); mask++) {
        if (mask == 0) {
          if (j == 0) {
            res += dp[cur][i][j][mask] * (8 + i);
          } else {
            res += dp[cur][i][j][mask] * 8;
          }
          continue;
        }
        int x = mask & (-mask);
        int f = log2(x);
        res += dp[cur][i][j][mask] * f;
      }
    }
  }
  printf("%0.17f", (double)res);
  return 0;
}
