#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
using mint = modint998244353;

void solve() {
  string N; cin >> N;
  ll M; cin >> M;
  int D = N.size();
  ll S = (N[0] - '0') % (2 * M);
  for (int i = 1; i < D; i++) {
    S = (S * 10 + (N[i] - '0')) % (2 * M);
  }
  cout << (S * (S + 1)) % (2 * M) / 2 << endl;
}

int main() {
  int T; cin >> T;
  while (T--) {
    solve();
  }
  return 0;
}