#include<iostream>
#include<memory.h>
#include<cstdio>
#include<cmath>
#include<string>
#include<queue>
#include<algorithm>
#include<stack>
#include<cstring>
#include<vector>
#include<list>
#include<set>
using namespace std;
int scan()
{
    int res = 0 , ch ;
    while( !( ( ch = getchar() ) >= '0' && ch <= '9' ) )
    {
        if( ch == EOF )  return 1 << 30 ;
    }
    res = ch - '0' ;
    while( ( ch = getchar() ) >= '0' && ch <= '9' )
        res = res * 10 + ( ch - '0' ) ;
    return res ;
}
int a[10010][110];
int duan[100];
bool cmp(int x,int y)
{
    return x>y;
}
int f(int a,int b,int c,int x)
{
    return a*x*x+b*x+c;
}
int main()
{
    int x,y,hang;
    scanf("%d",&x);
    while(x--)
    {
        int a,b,c,l,r;
        int maxx=-222222222;
        int minn=222222222;
        scanf("%d%d%d%d%d",&a,&b,&c,&l,&r);
        for(int i=l;i<=r;i++)
        {
            int gg=f(a,b,c,i);
            if(gg>maxx)
                maxx=gg;
            if(gg<minn)
                minn=gg;
        }
        printf("%d %d\n",maxx,minn);
    }
    return 0;
}