poj3685

        for(int i = 0;i < N; i++){
                sum += N - lower_bound(i+1, x);
        }
        return sum > N*N - M;
}
LL solve(){
        LL lb = -50000000000, ub = 20000000000;
        while(ub - lb > 1){
                LL mid = (ub + lb ) / 2;
                if(C(mid))  lb = mid;
                else ub = mid;
        }
        return lb;
}
int main(){
        int t;
        scanf("%d", &t);
        while(t--){
                scanf("%lld%lld", &N, &M);
                LL ans = solve();
                printf("%lld\n", ans);
        }
        return 0;
}