#include <cstdio>
#include <cmath>
inline long long solve(long long gr, long long n, long long r){
    long long st, x, a, l, i, b;
    x=st=(gr-1)*gr+1;
    l=gr-1;
    for(i=2; i<=n; i++){
        x+=r;
        gr=sqrt(x);
        b=gr*(gr+1);
        if(x>b){
            b+=2*gr;
            gr++;
        }
        b++;
        a=b-2*gr;
        if(x-a>gr-1){
            l-=b-x;
            st+=b-x;
            x+=b-x;
        }else if(l>a+gr-1-x){
            l=a+gr-1-x;
        }
        if(l<0){
            return 0;
        }
    }
    return st;
}
int main(){
    int t, n, r, gr;
    long long x;
    FILE *fin, *fout;
    fin=fopen("progresie.in", "r");
    fout=fopen("progresie.out", "w");
    fscanf(fin, "%d", &t);
    for(; t; t--){
        fscanf(fin, "%d%d", &n, &r);
        gr=1;
        while((x=solve(gr, n, r))==0){
            gr++;
        }
        fprintf(fout, "%lld\n", x);
    }
    fclose(fin);
    fclose(fout);
    return 0;
}