#include <bits/stdc++.h>
using namespace std;
using PP = pair<long, long>;
const int INF = 1e9;
template <class T> T Next() { T buf; cin >> buf; return buf; }

long sub() {
  int n, m;
  cin >> n >> m;
  if (n >= m) return 0;
  
  long p = 1;
  for (int i = 1; i <= n; ++i) {
    p = (p * i) % m;
  }
  return p;
}

int main() {
  cout << sub() << endl;
}