#include <cstdio>
#include <iostream>
#include <queue>
#include <algorithm>
#include <cstring>
using namespace std;
#define FOR(i,j,k) for(int i =j; i<=k ;i++)
#define LL long long
const int maxn  =105;
LL mul(LL a,LL b,LL mod){
    LL n = 0;
    while(b){
        if(b&1)
            n = (n+a)%mod;
        a = (a*2)%mod;
        b /= 2;
    }
    return n;
}

int main()
{
    int t;
    cin>>t;
    while(t--){
        LL q,p;
        cin>>q>>p;
        cout<<mul(q-1,q-2,2*p)/2<<endl;
    }
    return 0;
}