#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0), cin.tie(0)
#define int long long
#define ppc __builtin_popcount
#define endl '\n'
#define lowbit(x) (x & -x)
#define all(s) s.begin(), s.end()
#define pii pair<int,int>
#define ls(x) (x<<1)
#define rs(x) (x<<1|1)
#define here system("pause")
using namespace std;
template <class T>
inline void read(T &x){
	x = 0;
	char c = getchar();
	bool f = 0;
	for (; !isdigit(c); c = getchar()) f ^= (c == '-');
	for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + (c ^ 48);
	x = f ? -x : x;
}
template <class T>
inline void write(T x){
	if (x < 0) putchar('-'), x = -x;
	if (x < 10) putchar(x + 48);
	else write(x / 10), putchar(x % 10 + 48);
}
template<typename T> void chkmin(T& lhs, const T& rhs) { lhs = lhs > rhs ? rhs : lhs; }
template<typename T> void chkmax(T& lhs, const T& rhs) { lhs = lhs < rhs ? rhs : lhs; }

const int N = 2e5 + 4;
const int INF = 8e18 + 9;
const double eps = 1e-9;
const double Pi = acos(-1);
inline int pow(int a, int b, int p){ int res = 1%p; while(b){ if(b&1) res=res*a%p; a=a*a%p, b>>=1;} return res;}
inline int inv(int a, int p){ return pow(a,p-2,p)%p;}
mt19937 rnd(chrono::duration_cast<chrono::nanoseconds>(chrono::system_clock::now().time_since_epoch()).count());
int randint(int L, int R) {
	uniform_int_distribution<int> dist(L, R);
	return dist(rnd);
}
int n, m, mod;
int sq;
bool vis[N];
int primes[N], cnt;
int w[N], g[N];
int id1[N], id2[N];
int ans[15];

void init() {
    vis[1] = 1;
    for (int i = 2; i <= sq; i++) {
        if (!vis[i]) primes[++cnt] = i;
        for (int j = 1; j <= cnt && primes[j] <= sq / i; j++) {
            vis[i * primes[j]] = 1;
            if (i % primes[j] == 0) break;
        }
    }
}

inline int get(int x) {
    if (x < N) return id1[x];
    return id2[n / x];
}


void dfs(int u, int x, int w) {
    if (primes[u] > x) return;
    ans[w + 1] += g[get(x)] - u;
    for (int i = u + 1; i <= cnt && primes[i] * primes[i] <= x; i++) {
        for (int c = 1, pows = primes[i]; pows <= x; c += 1, pows *= primes[i]) {
            if (c > 1) {
                ans[w + 1] += 1;
            }
            dfs(i, x / pows, w + 1);
        }
    }
}

signed main() {
    IOS;
    cin >> n >> mod;
    sq = sqrt(n);
    while ((sq + 1) * (sq + 1) <= n) sq++;
    while (sq * sq > n) sq--;
    init();
    for (int l = 1, r; l <= n; l = r + 1) {
        int v = n / l;
        r = n / v;
        w[++m] = v;
        if (v < N) id1[v] = m;
        else id2[n / v] = m;
        g[m] = v - 1;
    }
    for (int i = 1; i <= cnt; i++) {
        for (int j = 1; j <= m && primes[i] * primes[i] <= w[j]; j++) {
            g[j] -= g[get(w[j] / primes[i])] - (i - 1);
        }
    }
    dfs(0, n, 0);
    int res = 1;
    for (int i = 2; i <= 10; i++) {
        res = res * pow(i, ans[i], mod) % mod;
    }
    cout << res << '\n';
    return 0;
}