#include <cstdio>
#include <cmath>
inline long long solve(long long gr, long long n, long long r){
    long long st, l, i, x, a;
    st=(gr-1)*gr+1;
    l=gr-1;
    for(i=1; i<n; i++){
        x=st+i*r;
        gr=1+(int)sqrt(x-1);
        a=(gr-1)*gr+1;
        if(x+l<a){
            return 0;
        }
        if(x<a){
            l-=a-x;
            st+=a-x;
        }else if(x+l>a+gr-1){
            l=a+gr-1-x;
        }
    }
    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;
}