#include using namespace std; typedef long long ll; #define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++) #define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--) template bool chmin(T &a, const T &b) { if (a <= b) return false; a = b; return true; } template bool chmax(T &a, const T &b) { if (a >= b) return false; a = b; return true; } template T max(vector &a){ assert(!a.empty()); T ret = a[0]; for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]); return ret; } template T min(vector &a){ assert(!a.empty()); T ret = a[0]; for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]); return ret; } template T sum(vector &a){ T ret = 0; for (int i=0; i<(int)a.size(); i++) ret += a[i]; return ret; } void solve(){ string s; cin >> s; vector x; rep(i,0,(int)s.size()){ x.push_back(s[i] - '0'); } auto increment = [&](vector x) -> vector { vector y; int up = 1; rrep(i,0,(int)x.size()){ if (up == 0){ y.push_back(x[i]); }else{ if (x[i] + up >= 10){ y.push_back(0); }else{ y.push_back(x[i] + up); up = 0; } } } if (up == 1){ y.push_back(1); } reverse(y.begin(), y.end()); return y; }; auto half = [&](vector x) -> vector { assert(x.back() % 2 == 0); vector y = x; vector z((int)y.size()); rep(i,0,(int)x.size()){ z[i] = y[i] / 2; if (i < (int)x.size() - 1){ y[i] %= 2; y[i+1] += y[i] * 10; } } return z; }; int m; cin >> m; ll tar1 = 0; ll tar2 = 0; if (x.back() % 2 == 1){ rep(i,0,(int)x.size()){ tar1 = (tar1 * 10 + x[i]) % m; } x = increment(x); x = half(x); rep(i,0,(int)x.size()){ tar2 = (tar2 * 10 + x[i]) % m; } }else{ vector y = half(x); rep(i,0,(int)y.size()){ tar1 = (tar1 * 10 + y[i]) % m; } x = increment(x); rep(i,0,(int)x.size()){ tar2 = (tar2 * 10 + x[i]) % m; } } cout << tar1 * tar2 % m << '\n'; } int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while(t--) solve(); }