#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
const int N = 50 + 7;
const int mod = 1e9 + 7;
long long n, t;
double binpow(double a, long long b) {
  double res = 1;
  while (b) {
    if (b % 2) {
      res *= a;
    }
    a *= a;
    b >>= 1;
  }
  return res;
}
int main() {
  cin >> n >> t;
  double x = 1.000000011;
  double ans = binpow(x, t);
  ans *= n;
  cout << fixed << setprecision(30) << ans;
}
