#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,1,0,-1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}


map<ll,ll> factor(long long n) {
    map<ll,ll> ret;
    ll t=n;
    for (long long i = 2; i * i <= n; i++) {
        while (t % i == 0) {
            ret[i]++;t/=i;
        }
    }
    if(t!=1)ret[t]++;
    return ret;
}

int main(){
  ll n;cin >> n;
  ll m;cin >> m;
  ll cnt=0;
  auto p=factor(m).rbegin()->first;
  ll q=n;
  while(q){
    cnt+=q/p;
    q/=p;
  }
  CST(10);
  auto f=log10l(expl(1))*((logl(n)-1)*n+logl(acosl(-1)*2*n)/2)-log10l(m)*cnt;
  if(n<=10000){
    f=0;
    for(ll i=1;i<=n;i++)f+=log10l(i);
    rep(i,cnt)f-=log10l(m);
  }
  ll z=floorl(f);
  //cout << z << endl;
  long double ans=0;
  for(long double i=1.0000;i<10;i+=0.000001){
    if(log10l(i)<=f-z)ans=i;
  }
  cout << ans << "e" << z << endl;
}