#include <bits/stdc++.h>
using namespace std;
const long long MX = 32;
long long calc(long long id, long long d) {
  if (d < (1LL << id)) {
    return 0;
  }
  return min((1LL << (id)), d - (1LL << id) + 1);
}
void solve() {
  long long d, MOD;
  cin >> d >> MOD;
  long long total = 0;
  long long dp[MX][MX];
  for (auto &i : dp)
    for (auto &j : i) j = 0;
  for (long long i = 0; i < MX; ++i) {
    dp[1][i] = calc(i, d);
  }
  for (long long len = 2; len < MX; ++len) {
    for (long long id = 1; id < MX; ++id) {
      long long x = calc(id, d);
      for (long long pref_id = 0; pref_id < id; ++pref_id) {
        dp[len][id] = (dp[len][id] + (dp[len - 1][pref_id] * x) % MOD) % MOD;
      }
    }
  }
  for (long long len = 1; len < MX; ++len) {
    for (long long j = 0; j < MX; ++j) {
      total = (total + dp[len][j]) % MOD;
    }
  }
  cout << total << '\n';
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  long long t;
  cin >> t;
  while (t--) {
    solve();
  }
}
