#include <iostream>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
long long factorial = 1;
long long max_factorial_mod = 0;
for (long long i = 1; i <= n; ++i) {
factorial = (factorial * i) % m;
max_factorial_mod = max(max_factorial_mod, factorial);
}
cout << max_factorial_mod << endl;
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBtYWluKCkgewogIGxvbmcgbG9uZyBuLCBtOwogIGNpbiA+PiBuID4+IG07CgogIGxvbmcgbG9uZyBmYWN0b3JpYWwgPSAxOwogIGxvbmcgbG9uZyBtYXhfZmFjdG9yaWFsX21vZCA9IDA7CgogIGZvciAobG9uZyBsb25nIGkgPSAxOyBpIDw9IG47ICsraSkgewogICAgZmFjdG9yaWFsID0gKGZhY3RvcmlhbCAqIGkpICUgbTsKICAgIG1heF9mYWN0b3JpYWxfbW9kID0gbWF4KG1heF9mYWN0b3JpYWxfbW9kLCBmYWN0b3JpYWwpOwogIH0KCiAgY291dCA8PCBtYXhfZmFjdG9yaWFsX21vZCA8PCBlbmRsOwogIHJldHVybiAwOwp9Cg==