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;
const int maxn = 240;
double P, opt[2][2][maxn][1 << 9];
int x, k, p, t, mask;
int main() {
  scanf("%d%d%d", &x, &k, &p);
  P = (double)p / 100;
  mask = (1 << 9) - 1;
  t = (x ^ (x & mask)) >> 9;
  int sum0 = 0, sum1 = 0, sum, st = 0;
  while (t > 0 && (t & 1) == 0) {
    sum0++;
    t >>= 1;
  }
  t = (x ^ (x & mask)) >> 9;
  while (t > 0 && (t & 1) == 1) {
    sum1++;
    t >>= 1;
  }
  for (int i = 0; i <= k; i++)
    for (int u = 0; u < (1 << 9); u++)
      for (int j = 0; j < maxn; j++) opt[0][0][j][u] = opt[0][1][j][u] = 0.0;
  if (sum0 > 0) {
    opt[0][0][sum0][x & mask] = 1.0;
  } else {
    opt[0][1][sum1][x & mask] = 1.0;
  }
  for (int i = 0; i < k; i++) {
    for (int u = 0; u < (1 << 9); u++)
      for (int j = 0; j < maxn; j++)
        opt[1 - st][0][j][u] = opt[1 - st][1][j][u] = 0.0;
    for (int u = 0; u < (1 << 9); u++)
      for (int j = 0; j < maxn; j++) {
        if (opt[st][0][j][u] > 0) {
          if (((u + 1) & mask) == (u + 1)) {
            opt[1 - st][0][j][u + 1] += opt[st][0][j][u] * (1 - P);
          } else {
            opt[1 - st][1][1][(u + 1) & mask] += opt[st][0][j][u] * (1 - P);
          }
          if (((u << 1) & mask) == (u << 1)) {
            opt[1 - st][0][j + 1][u << 1] += opt[st][0][j][u] * P;
          } else {
            opt[1 - st][1][1][(u << 1) & mask] += opt[st][0][j][u] * P;
          }
        }
        if (opt[st][1][j][u] > 0) {
          if (((u + 1) & mask) == (u + 1)) {
            opt[1 - st][1][j][u + 1] += opt[st][1][j][u] * (1 - P);
          } else {
            opt[1 - st][0][j][(u + 1) & mask] += opt[st][1][j][u] * (1 - P);
          }
          if (((u << 1) & mask) == (u << 1)) {
            opt[1 - st][0][1][u << 1] += opt[st][1][j][u] * P;
          } else {
            opt[1 - st][1][j + 1][(u << 1) & mask] += opt[st][1][j][u] * P;
          }
        }
      }
    st = 1 - st;
  }
  double ans = 0.0;
  for (int j = 0; j < maxn; j++) {
    ans += opt[st][0][j][0] * (j + 9) + opt[st][1][j][0] * 9;
    for (int u = 1; u < (1 << 9); u++) {
      for (t = u, sum = 0; t > 0 && (t & 1) == 0; t >>= 1, sum++)
        ;
      ans += (opt[st][1][j][u] + opt[st][0][j][u]) * sum;
    }
  }
  printf("%lf\n", ans);
}
