#include <map>
#include <set>
#include <array>
#include <cmath>
#include <deque>
#include <bitset>
#include <random>
#include <string>
#include <vector>
#include <cassert>
#include <complex>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>

#pragma GCC optimize("fast-math")

using namespace std;


using ld = double;

const ld PI = atan2l(0, -1);

ld fact(int x) {
    if (x == 0) return 0;
    return log(2 * PI * x) / 2 + x * log(x) - x;
}

ld C(int n, int k) {
    return fact(n) - fact(k) - fact(n - k);
}

ld add(ld p, ld q) {
    if (p > q) swap(p, q);
    return q + log(1 + exp(p - q));
}

const int D = 2000;

ld get_start(int n, int k) {
    int len = (n + D - 1) / D;
    ld cur = 0;
    for (int i = 0; i <= k; i += len) {
        int L = i, R = min(k + 1, i + len);

        int P = (1.00015*L + R) / 2.00015;
        // int P = (1.0001*L + R) / 2.0001;

        ld res = C(n, P) - (P - L) * log(2);
        // cerr << res << ' ' << C(n, L) << '\n';
        if (R - L < 60) {
            res += L * log(2) + log((1ll << (R - L)) - 1);
        } else {
            res += R * log(2);
        }
        cur = add(cur, res);
    }
    return n * log(3) - cur;
}

void solve() {
    int n, k;
    cin >> n >> k;
    k = min(k, n);
    ld ans = log(3ll * k + 1);
    // cerr << "p : " << ans << '\n';
    ans += get_start(n, k);
    cout << ans << "\n";
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);

  cout << fixed << setprecision(20);

  int tst;
  cin >> tst;
  while (tst--) {
    solve();
  }


  return 0;
}