#include <stdio.h>

int N, left, right;

long long func( int x )
{
    return (long long)x*x*2 - 12*x + 7;
}

void solve()
{
    int mid1 = left + (right - left) / 3;
    int mid2 = right - (right - left) / 3;

    while( left < right )
    {
        long long f1 = func(mid1);
        long long f2 = func(mid2);
        if( f1 <= f2 )
        {
            right = mid2 - 1;
        }
        else
        {
            left = mid1 + 1;
        }

        mid1 = left + (right - left) / 3;
        mid2 = right - (right - left) / 3;
    }
    printf("%lld\n", func(right));
}


void input()
{
    scanf("%d", &N);
    for( int i = 0; i < N; i++ )
    {
        scanf("%d %d", &left, &right);
        solve();
    }
}

int main()
{
    input();
    return 0;
}