#include <bits/stdc++.h>
using namespace std;
using ll=long long;

constexpr const int maxa=1000000001;

ll mod(string n,ll k){
    int m=n.size();
    ll res=0;
    for(int i=0;i<m;i++){
        res=res*10+(n[i]-'0');
        res%=k;

    }
    return res;
}
int main()
{
    int t;
    cin>>t;
    while(t--){
        string n;
        ll k;
        cin>>n>>k;
        ll ans=mod(n,2*k);
        cout<<((ans*(ans+1))/2)%k<<endl;
    }
    return 0;

}