#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <iomanip>
#include <sys/time.h>
#include <tuple>
#include <random>
using namespace std;

#define endl '\n'
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define UNIQ(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef complex<double> comp;
typedef vector< vector<ld> > matrix;
struct pairhash {
public:
    template<typename T, typename U>
    size_t operator()(const pair<T, U> &x) const {
	size_t seed = hash<T>()(x.first);
	return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
    }
};
const int inf = 1e9 + 9;
const ll mod = 1e9 + 7;
const double eps = 1e-8;
const double pi = acos(-1);

ll n, m;

void solve() {
    ll k = 0;
    ll t = m;
    while (t <= n) {
        k += n / t;
        if (t * m < t) break;
        t *= m;
    }

    if (n < 30) {
        double res = 1.0;
        for (ll i = n; i > 0; i--)
            res *= i;
        for (int i = 0; i < k; i++)
            res /= m;
        int b = 0;
        while (res >= 10.0) {
            b++;
            res /= 10;
        }
        cout << res << "e" << b << endl;
    } else {
        double exp = n * log(n) - n + 0.5 * log(2*pi*n) + 1.0 / (12*n);
        exp -= k * log(m);
        exp /= log(10);
        ll b = (ll)exp;
        cout << pow(10.0, exp - b) << "e" << b << endl;
    }
}

void input() {
    cin >> n >> m;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);

    input();
    solve();
}