// compile: make data
// run: ./data < data.in
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#ifdef LOCAL
#include <debug/codeforces.h>
#define debug(x...) _debug_print(#x, x);
#else
#define debug(x...) {};
#endif
template<typename...Args> void print_(Args...args){((cout<<args<<" "),...)<<endl;}
#define rep(i,a,b) for(int i=(a);i<(int)(b);++i)
#define sz(v) ((int)(v).size())
#define print(...) print_(__VA_ARGS__);
#define cmin(x,...) x=min({(x), __VA_ARGS__})
#define cmax(x,...) x=max({(x), __VA_ARGS__})
#define INTMAX (int)(9223372036854775807)
#define INF (int)(1152921504606846976)
#define double long double
#define int long long
#define MAXN 200010

void solve() {
    int n, k; cin >> n >> k;
    vector<int> a(n);
    int sum = 0;
    rep(i, 0, n) {
        int m = ceil((i+1) * 1.0 / k);
        if (sum < m) a[i] = 1, ++sum;
    }
    sum = 0;
    rep(i, 0, n) {
        sum += a[n-i-1];
        int m = ceil((i+1) * 1.0 / k);
        if (sum < m) a[n-i-1] = 1, ++sum;
    }
    int ans = accumulate(a.begin(), a.end(), 0);
    cout << ans << endl;
}

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

    int _; cin >> _;
    while (_--) solve();

    return 0;
}