#include <bits/stdc++.h>
using namespace std;
const int P = 1e9 + 7, INF = 0x3f3f3f3f;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long qpow(long long a, long long n) {
  long long r = 1 % P;
  for (a %= P; n; a = a * a % P, n >>= 1)
    if (n & 1) r = r * a % P;
  return r;
}
long long inv(long long first) {
  return first <= 1 ? 1 : inv(P % first) * (P - P / first) % P;
}
inline int rd() {
  int first = 0;
  char p = getchar();
  while (p < '0' || p > '9') p = getchar();
  while (p >= '0' && p <= '9') first = first * 10 + p - '0', p = getchar();
  return first;
}
const int N = 1e6 + 50;
int d, m;
void work() {
  scanf("%d%d", &d, &m);
  int mx = 0;
  for (int i = 30; i >= 0; --i)
    if (d >> i & 1) {
      mx = i;
      break;
    }
  long long ans = 1;
  for (int i = 0; i <= mx - 1; ++i) {
    ans = ans * (1 + (1 << i)) % m;
  }
  ans = ans * (1 + (d - (1 << mx) + 1)) % m;
  ans = (ans - 1) % m;
  if (ans < 0) ans += m;
  printf("%lld\n", ans);
}
int main() {
  int t;
  scanf("%d", &t);
  while (t--) work();
}
