#include <cstdio>
#include <algorithm>
#include <cmath>

using namespace std;

int t, n, pas, m, pmm;
long long s;

long long verifx(long long x)
{
    int sol=(int)sqrt(x);

    return max(0LL, 1LL*sol*(sol+1)+1-x);
}

long long verif(long long s)
{
    pas++;
    long long ss=0;
    for(int i=0; i<n; ++i)
    {
        ss=verifx(s+1LL*m*i);
        if(ss>0)
            return ss;
    }
    return ss;
}

long long start(int n, int m)
{
    long long s=1;
    if(n<=20)
        s=1;
    if(n>20 && m>500000)
        s=1LL*n*m*80;
    if(n>24 && m>1000000)
        s=1LL*n*m*85;
    if(n>24 && m>10000000)
        s=1LL*n*m*45;
    if(n>28 && m>1000000)
        s=1LL*n*m*155;
    if(n>28 && m>10000000)
        s=1LL*n*m*175;
    return s;
}

int main()
{
    freopen("progresie.in", "r", stdin);
    freopen("progresie.out", "w", stdout);

    scanf("%d", &t);
    long long x;
    while(t--)
    {
        scanf("%d%d", &n, &m);
        s=start(n, m);
        while(1)
        {
            x=verif(s);
            if(x==0)
                break;
            s+=x;
        }
        printf("%d\n", pas);
        printf("%lld\n", s);
    }
    return 0;
}