#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <sstream>
#include <functional>
#include <map>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <list>
#include <numeric>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double Num;
typedef pair<ll,ll> P;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const ll INF = 1LL<<29;
const ll mod = 1e9+7;
#define rep(i,n) for(int (i)=0;(i)<(ll)(n);++(i))
#define repd(i,n,d) for(ll (i)=0;(i)<(ll)(n);(i)+=(d))
#define all(v) (v).begin(), (v).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset((m),(v),sizeof(m))
#define chmin(X,Y) ((X)>(Y)?X=(Y),true:false)
#define chmax(X,Y) ((X)<(Y)?X=(Y),true:false)
#define fst first
#define snd second
#define UNIQUE(x) (x).erase(unique(all(x)),(x).end())
template<class T> ostream &operator<<(ostream &os, const vector<T> &v){int n=v.size();rep(i,n)os<<v[i]<<(i==n-1?"":" ");return os;}

#define N 1000
Num fact[N];
const Num E = exp(1);

Num f(ll x){
	return x<N ? fact[x] : sqrt(2*PI*x)*pow(x/E, x);
}

Num logf(ll x){
	return log10(2*PI*x)*0.5 + (log10(x)-log10(E))*x;
}

int main(){
	fact[0] = 1;
	rep(i, N-1) fact[i+1] = fact[i]*(i+1);

	ll x, y;
	cin>>x>>y;
	ll cnt = 0, xx = x;
	while(xx){
		xx /= y;
		cnt += xx;
	}

	cout.precision(5);
	if(x<N){
		return -1;
		Num res = f(x);
		res /= pow(y, cnt);
		ll d = log10(res);
		res /= pow(10, d);
		cout<<fixed<<res<<'e'<<d<<endl;
	} else {
		Num res = logf(x);
		res -= log10(y)*cnt;
		ll d = floor(res);
		res -= d;
		cout<<fixed<<pow(10, res)<<'e'<<d<<endl;
	}
	
	return 0;
}