#include <iostream>
#include <vector>
#include <algorithm>
#include <atcoder/fenwicktree>
using namespace std;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
#define rep(i,n) for(int i=0; i<(n); i++)


i64 f(i64 N, i64 M){
    if(N == 1) return 0;
    if(N * 2 <= M) return N * (N+1) / 2 - 1 + (N - 1);
    if(M % 2 == 0) return N - M/2 + f(M - N, M);
    return N - M/2 - 1 + f(M - N, M);
}

i64 testcase(){
    i64 N,M; cin >> N >> M;
    if(N == M-1) return (M-1)/2;
    if(N >= M) return (M-1)/2 + 1;
    return f(N, M);
}



int main(){
    int T; cin >> T;
    rep(i,T) cout << testcase() << "\n";
    return 0;
}


struct ios_do_not_sync{
    ios_do_not_sync(){
        std::ios::sync_with_stdio(false);
        std::cin.tie(nullptr);
    }
} ios_do_not_sync_instance;