#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
using namespace std;
template <class T, class S>
ostream &operator<<(ostream &o, pair<T, S> p) {
  return o << '(' << p.first << ", " << p.second << ')';
}
template <template <class, class...> class T, class... A>
typename enable_if<!is_same<T<A...>, string>(), ostream &>::type operator<<(
    ostream &o, T<A...> V) {
  o << '[';
  for (auto a : V) o << a << ", ";
  return o << ']';
}
map<long long int, long long int> bcount;
map<long long int, long long int> dp;
long long int N;
long long int M;
long long int r(long long int n) {
  if (dp.count(n)) return dp[n];
  if (n == N) return dp[n] = bcount[n];
  for (long long int i = n + 1; i <= N; ++i) {
    dp[n] += r(i);
    dp[n] %= M;
  }
  dp[n]++;
  dp[n] = dp[n] * bcount[n];
  dp[n] %= M;
  return dp[n];
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int t;
  cin >> t;
  while (t--) {
    long long int d;
    cin >> d >> M;
    bcount.clear();
    for (long long int bit = 0; bit < 40; ++bit) {
      bool gay = (d >> (bit + 1)) == 0;
      if (gay) {
        bcount[bit] = d - (1ll << bit) + 1;
        N = bit;
        break;
      } else {
        bcount[bit] = (1ll << (bit));
      }
    }
    dp.clear();
    long long int ans = 0;
    for (long long int start = 0; start < bcount.size(); ++start) {
      ans = ans + r(start);
      ans %= M;
    }
    cout << ans << endl;
  }
}
