#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int DY[]{1, 0, -1, 0}, DX[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1}, DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

void solve() {
  int n, c; cin >> n >> c;
  assert(c == 2);
  ll ans = (1 << (n << 1)) + (1 << n);
  int g = 2;
  for (int rot = 1; rot * 2 <= n; ++rot) {
    const int add = (rot * 2 == n ? 1 : 2);
    ans += add << (gcd(n, rot) << 1);
    ans += add << (n / gcd(n, rot) % 2 == 0 ? gcd(n, rot) << 1 : gcd(n, rot));
    g += add * 2;
  }
  ans += (1 << n) * n;
  g += n;
  if (n % 2 == 0) {
    ans += (1 << n) * n;
    g += n;
  }
  cout << ans / g << '\n';
}

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