Problem: The city administration of IT City decided to fix up a symbol of scientific and technical progress in the city's main square, namely an indicator board that shows the effect of Moore's law in real time.

Moore's law is the observation that the number of transistors in a dense integrated circuit doubles approximately every 24 months. The implication of Moore's law is that computer performance as function of time increases exponentially as well.

You are to prepare information that will change every second to display on the indicator board. Let's assume that every second the number of transistors increases exactly 1.000000011 times.

Input

The only line of the input contains a pair of integers n (1000 ≤ n ≤ 10 000) and t (0 ≤ t ≤ 2 000 000 000) — the number of transistors in the initial time and the number of seconds passed since the initial time.

Output

Output one number — the estimate of the number of transistors in a dence integrated circuit in t seconds since the initial time. The relative error of your answer should not be greater than 10 - 6.

Examples

Input

1000 1000000


Output

1011.060722383550382782399454922040

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
void solve(int test_number);
void pre() {
  cout.setf(ios::fixed);
  cout.precision(64);
  cerr.setf(ios::fixed);
  cerr.precision(3);
}
void post() {
  printf("\n");
  fprintf(stderr, "Execution time: %Lf", (long double)clock());
}
const int MAXN = 100100;
inline long double sqr(long double x) { return x * x; }
inline long double power(long double a, long long pow_) {
  if (pow_ == 1) return a;
  if (pow_ == 0) return 1.0;
  if (pow_ % 2 == 0) {
    return sqr(power(a, pow_ / 2));
  } else {
    return a * sqr(power(a, (pow_ - 1) / 2));
  }
}
inline void solve(int test_number) {
  long long n, t;
  scanf("%lld %lld", &n, &t);
  cout << n * power(1.000000011, t) << endl;
  return;
}
int main() {
  pre();
  int n = 1;
  for (int i = 0; i < n; i++) {
    solve(i + 1);
  }
  post();
  return 0;
}