// #pragma GCC target("avx")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

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

#define rep(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(n) for(int i = 0; i < (int)n; i++)
#define repi(i,a,b) for(int i = (int)a; i < (int)b; i++)
#define all(x) x.begin(),x.end()
//#define mp make_pair
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vvvvi vector<vvvi>
#define pii pair<int,int>
#define vpii vector<pair<int,int>>

template<typename T>
bool chmax(T &a, const T b) {if(a<b) {a=b; return true;} else {return false;}}
template<typename T>
bool chmin(T &a, const T b) {if(a>b) {a=b; return true;} else {return false;}}

using ll = long long;
using ld = long double;
using ull = unsigned long long;

const ll INF = numeric_limits<long long>::max() / 2;
const ld pi = 3.1415926535897932384626433832795028;
const ll mod = 998244353;
int dx[] = {1, 0, -1, 0, -1, -1, 1, 1};
int dy[] = {0, 1, 0, -1, -1, 1, -1, 1};

#define int long long

string div(string s, int d) {
    bool carry = false;
    string ret;
    FOR(s.size()) {
        int val = (10 * carry + s[i] - '0');
        ret.push_back((char)(val/2 + '0'));
        carry = (val%2 == 1);
    }
    return ret;
}
string inc(string s) {
    if((int)s.size() == (int)count(all(s), '9')) {
        string ret = "1";
        ret += string((int)s.size(), '0');
        return ret;
    }else {
        int id = (int)s.size()-1;
        while(s[id] == '9') --id;
        assert(id >= 0);
        ++s[id];
        repi(i, id+1, (int)s.size()) s[i] = '0';
        return s;
    }
}
int eval(string s, int m) {
    int rem = 0;
    for(auto e : s) {
        rem = (rem * 10 + e - '0') % m;
    }
    return rem;
}

void solve() {
    string n;
    int m;
    cin >> n >> m;

    if((n.back())%2 == 0) {
        cout << (eval(div(n, 2), m) * eval(inc(n), m)) % m << endl;
    }else {
        cout << (eval(n, m) * eval(div(inc(n), 2), m)) % m << endl;
    }
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int t;
    cin >> t;
    while(t--) solve();
    return 0;
}