#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define debug 0
#define YES cout << "Yes" << endl;
#define NO cout << "No" << endl;
using ll = long long;
using ld = long double;
const int mod = 998244353;
const int MOD = 1000000007;
const double pi = atan2(0, -1);
#include <time.h>
#include <chrono>

int main() {
	int T;
	cin >> T;
	rep(test, T) {
		string n;
		ll M;
		cin >> n >> M;
		int k = n.size();
		ll N = 0;
		vector<ll> ten(k);
		ten[0] = 1;
		ll m = M;
		if (M % 2 == 0) {
			m *= 2;
		}
		rep(i, k - 1) {
			ten[i + 1] = ten[i] * 10;
			ten[i + 1] %= m;
		}
		rep(i, k) {
			N += (ll)(n[i] - '0') * ten[k - 1 - i];
			N %= m;
		}
		cout << N * (N + 1) / 2 % M << endl;
	}
}