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 N = 256;
const int inf = 1000000007;
int x, k, p, zero[N];
double dp[205][N][N][2];
int main() {
  scanf("%d%d%d", &x, &k, &p);
  if (x < 256) {
    dp[0][x][0][0] = 1.0;
  } else {
    int xx = x / 256;
    if (x & 1) {
      int p = 0;
      while ((1 << p) & xx) p++;
      dp[0][x % 256][p][1] = 1.0;
    } else {
      int p = 0;
      while (!((1 << p) & xx)) p++;
      dp[0][x % 256][p][0] = 1.0;
    }
  }
  for (int i = 0; i < k; i++) {
    for (int j = 0; j < 256; j++) {
      for (int r = 0; r < 256; r++) {
        if (j * 2 >= 256) {
          dp[i + 1][(j * 2) % 256][1][1] += dp[i][j][r][0] * p / 100.0;
          dp[i + 1][(j * 2) % 256][r + 1][1] += dp[i][j][r][1] * p / 100.0;
        } else {
          dp[i + 1][(j * 2) % 256][r + 1][0] += dp[i][j][r][0] * p / 100.0;
          dp[i + 1][(j * 2) % 256][1][0] += dp[i][j][r][1] * p / 100.0;
        }
        if (j + 1 >= 256) {
          dp[i + 1][(j + 1) % 256][1][1] += dp[i][j][r][0] * (100 - p) / 100.0;
          dp[i + 1][(j + 1) % 256][r][0] += dp[i][j][r][1] * (100 - p) / 100.0;
        } else {
          dp[i + 1][(j + 1) % 256][r][0] += dp[i][j][r][0] * (100 - p) / 100.0;
          dp[i + 1][(j + 1) % 256][r][1] += dp[i][j][r][1] * (100 - p) / 100.0;
        }
      }
    }
  }
  double ans = 0.0;
  for (int i = 0; i < 256; i++) {
    for (int j = 0; j < 256; j++) {
      if (i == 0) {
        ans += dp[k][i][j][0] * (8 + j);
        ans += dp[k][i][j][1] * 8;
      } else {
        int p = 0;
        while (!(i & (1 << p))) p++;
        ans += dp[k][i][j][0] * p;
        ans += dp[k][i][j][1] * p;
      }
    }
  }
  printf("%.10f\n", ans);
  return 0;
}
