#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <cmath>
using namespace std;

const int maxn = 100005;
#define mem(a) memset(a,0,sizeof(a))

int main()
{
    int t;
    int a,b,c,r,l;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d%d%d%d",&a,&b,&c,&l,&r);
        int minn = a*l*l + b*l + c;
        int maxn = a*l*l + b*l + c;
        for(int i = l ; i <= r ; i++)
        {
            minn = min(minn,(a*i*i + b*i + c));
            maxn = max(maxn,(a*i*i + b*i + c));
        }
        printf("%d %d\n",maxn,minn);
    }
    return 0;
}