#include // cout, endl, cin #include // string, to_string, stoi #include // vector #include // min, max, swap, sort, reverse, lower_bound, upper_bound #include // pair, make_pair #include // tuple, make_tuple #include // int64_t, int*_t #include // printf #include // map #include // queue, priority_queue #include // set #include // stack #include // deque #include // unordered_map #include // unordered_set #include // bitset #include // isupper, islower, isdigit, toupper, tolower #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define ll long long #define ull unsigned long long #define ld long double typedef vector vll; using LL = long long; using ULL = unsigned long long; using VI = vector; using VVI = vector; using VVVI = vector; using VL = vector; using VVL = vector; using VVVL = vector; using VB = vector; using VVB = vector; using VVVB = vector; using VD = vector; using VVD = vector; using VVVD = vector; using VC = vector; using VS = vector; using VVC = vector; using PII = pair; using PLL = pair; using PDD = pair; using PIL = pair; using MII = map; using MLL = map; using SI = set; using SL = set; using MSI = multiset; using MSL = multiset; template using MAXPQ = priority_queue; template using MINPQ = priority_queue< T, vector, greater >; const ll MOD = 1000000007; const ll MOD2 = 998244353; const ll INF = 1LL << 60; #define PI 3.14159265358979323846 #define FOR(i, a, b) for(int i = (a); i < (b); ++i) #define REP(i, n) FOR(i, 0, n) #define EACH(e, v) for(auto &e : v) #define RITR(it, v) for(auto it = (v).rbegin(); it != (v).rend(); ++it) #define ALL(v) v.begin(),v.end() vector x8={1,1,1,0,0,-1,-1,-1},y8={1,0,-1,1,-1,1,0,-1}; int dx4[4]={1,-1,0,0}, dy4[4]={0,0,1,-1}; /* memo -uf,RMQ(segtree),BIT,BIT2,SegTree,SegTreeLazy -isprime,Eratosthenes,gcdlcm,factorize,divisors,modpow,moddiv(modpow必要) nCr(+modnCr,inverse,extend_euclid.powmod),tobaseB,tobase10 -dijkstra,Floyd,bellmanford,sccd,topological,treediamiter -compress1,compress2,rotate90 -co,ci,fo1,fo2,fo3,fo4 -bitsearch,binaryserach -bfs(vis.assign忘れるな) -SegTreedec,SegTreeLazydec */ template class mint { public: long long x; constexpr mint(long long x=0) : x((x%mod+mod)%mod) {} constexpr mint operator-() const { return mint(-x); } constexpr mint& operator+=(const mint& a) { if ((x += a.x) >= mod) x -= mod; return *this; } constexpr mint& operator-=(const mint& a) { if ((x += mod-a.x) >= mod) x -= mod; return *this; } constexpr mint& operator*=(const mint& a) { (x *= a.x) %= mod; return *this; } constexpr mint operator+(const mint& a) const { mint res(*this); return res+=a; } constexpr mint operator-(const mint& a) const { mint res(*this); return res-=a; } constexpr mint operator*(const mint& a) const { mint res(*this); return res*=a; } constexpr mint pow(long long t) const { if (!t) return 1; mint a = pow(t>>1); a *= a; if (t&1) a *= *this; return a; } // for prime mod constexpr mint inv() const { return pow(mod-2); } constexpr mint& operator/=(const mint& a) { return (*this) *= a.inv(); } constexpr mint operator/(const mint& a) const { mint res(*this); return res/=a; } }; using mint1 = mint<1000000007>; using mint2 = mint<998244353>; ll mpow(ll p, ll e, ll mod){ ll q; q = p; ll res = 1; while(e){ if(e&1) res *= q, res %= mod; q *= q; q %= mod; e/=2; } return res; } ll invmod(ll a,ll b, ll mod){ return (a*mpow(b,mod-2,mod))%mod; } int main(){ cin.tie(0); ios_base::sync_with_stdio(0); ll T; cin >> T; for(ll i = 0; i < T; i++){ string N; int M; cin >> N >> M; ll ten=1; //reverse(ALL(N)); ll n = N.size(); ll s=0; for(ll j = 0; j < n; j++){ ll num=N[j]-'0'; s *= 10; s %= M; s += num; s %= M; } ll s1 = s+1; s %= 2*M; s1 %= 2*M; cout << ((s*s1)%(2*M))/2 << endl; } }