#include using namespace std; typedef long long signed int LL; typedef long long unsigned int LU; #define incID(i, l, r) for(int i = (l) ; i < (r); i++) #define incII(i, l, r) for(int i = (l) ; i <= (r); i++) #define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--) #define decII(i, l, r) for(int i = (r) ; i >= (l); i--) #define inc( i, n) incID(i, 0, n) #define inc1(i, n) incII(i, 1, n) #define dec( i, n) decID(i, 0, n) #define dec1(i, n) decII(i, 1, n) #define inII(v, l, r) ((l) <= (v) && (v) <= (r)) #define inID(v, l, r) ((l) <= (v) && (v) < (r)) #define PB push_back #define EB emplace_back #define MP make_pair #define FI first #define SE second #define UB upper_bound #define LB lower_bound #define PQ priority_queue #define ALL(v) v.begin(), v.end() #define RALL(v) v.rbegin(), v.rend() #define FOR(i, v) for(auto i = v.begin(); i != v.end(); ++i) #define RFOR(i, v) for(auto i = v.rbegin(); i != v.rend(); ++i) template bool setmin(T & a, T b) { if(a <= b) { return false; } else { a = b; return true; } } template bool setmax(T & a, T b) { if(b <= a) { return false; } else { a = b; return true; } } template T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); } template T lcm(T a, T b) { return a / gcd(a, b) * b; } template ostream & operator<<(ostream & os, const vector & v) { os << "["; FOR(it, v) { if(it != v.begin()) { os << ", "; } os << *it; } os << "]"; return os; } template ostream & operator<<(ostream & os, const pair & p) { os << "<" << p.FI << ", " << p.SE << ">"; return os; } // ---- ---- int w, d; int main() { cin >> w >> d; dec1(i, d) { if(i == 1) { cout << w; return 0; } w -= w / (i * i); } }