hdu 3123

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<vector>
#include<algorithm>
#include<map>
using namespace std;
const int maxn = 1000000 + 10;
#define INF 0x3f3f3f3f
#define clr(x,y) memset(x,y,sizeof x )
typedef long long ll;
#define eps 10e-10
const ll Mod = 1000000007;
typedef pair<ll, ll> P;
int main()
{
    char n[105];
    ll m;
    int Tcase;
    scanf("%d",&Tcase);
    while(Tcase --)
    {
        scanf("%s%I64d",n,&m);
        int len = strlen(n);
        if(len >= 7)
            len = 6;
        ll cnt = 0;
        for(int i = 0; i < len;i ++)
        {
            cnt = cnt * 10 + n[i] - '0';
        }
        ll ans = 0,t = 1;
        for(int i = 1; i <= cnt + 1; i ++)
        {
            ans = (ans + t) % m;
            if(!t)
                break;
            t = t * i % m;
//            cout << t << " " <<ans << endl;
        }
        printf("%I64d\n",ans);
    }
    return 0;
}