#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint998244353;
//const int mod = 998244353;
//using mint = modint1000000007;
//const int mod = 1000000007;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
std::string add(const std::string &s, int d) {
	int n = d;
	std::string ret;
	for (int i = (int)s.size() - 1; i >= 0; --i) {
		n += s[i] - '0';
		ret += (n % 10) + '0';
		n /= 10;
	}
	if (0 != n)ret += n + '0';
	std::reverse(ret.begin(), ret.end());
	return ret;
}
std::string divide(const std::string &s, int d) {
	int n = 0;
	std::string ret;
	for (int i = 0; i < (int)s.size(); ++i) {
		n = n * 10 + s[i] - '0';
		int x = n / d;
		n %= d;
		if (0 == x && 0 == i)continue;
		ret += x + '0';
	}
	return ret;
}
long long mod(const std::string &s, long long m) {
	long long ret = 0;
	for (int i = 0; i < (int)s.size(); ++i) {
		ret = ret * 10 + s[i] - '0';
		ret %= m;
	}
	return ret;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int t; cin >> t;
	while (t--) {
		string s; cin >> s;
		long long m; cin >> m;
		auto s1 = add(s, 1);
		if (0 == (s.back() - '0') % 2) {
			s = divide(s, 2);
		}
		if (0 == (s1.back() - '0') % 2) {
			s1 = divide(s1, 2);
		}
		long long m0 = mod(s, m);
		long long m1 = mod(s1, m);
		long long ans = (m0 * m1) % m;
		cout << ans << endl;
	}
	return 0;
}