https://www.cometoj.com/contest/59/problem/C?problem_id=2698
n!!!数很大,超出mod就是mod的倍数了,肯定是0;
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <map>
#include <set>
#include <stack>
using namespace std;
#define sfi(x) scanf("%d",&x)
#define sfc(x) scanf("%c",x)
#define sfl(x) scanf("%lld",&x)
#define sfs(x) scanf("%s",x)
#define rint register int
#define pb push_back
#define fl() printf("flag!\n")
#define INF 0x3f3f3f3f
#define ll long long
#define mem(x,y) memset(x,y,sizeof(x))
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
const int maxn=2e5+9;
int main()
{
//FAST_IO;
//freopen("input.txt","r",stdin);
ll n,mod;
cin>>n>>mod;
if(n>3)
{
cout<<0<<endl;
}
else
{
if(n==0) cout<<1%mod<<endl;
else if(n==1)
{
cout<<1%mod<<endl;
}
else if(n==2)
{
cout<<2%mod<<endl;
}
else
{
ll num=1;
for(int i=2;i<=720;i++) num=num*i%mod;
cout<<num<<endl;
}
}
return 0;
}