#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cmath>
#include <ctime>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <string>
#include <sstream>
#include <utility>
#include <algorithm>
using namespace std;

typedef long long LL;
typedef long double LD;
typedef vector<int> VI;
typedef pair<int,int> PII;

const LD eps=1e-9;
const LD PI=atan2((LD)0,(LD)-1);
const LL MOD=1000000007;
const int INF=1<<30;
const int ARR_INF=1<<6;
const int MAXN=100005;

int T;
int a,b,c;

int F(int x)
{
    return a*x*x+b*x+c;
}

int main()
{
    scanf("%d",&T);
    while(T--)
    {
        int l,r;
        scanf("%d%d%d%d%d",&a,&b,&c,&l,&r);
        int maxx=-INF,minn=INF;
        for(int i=l;i<=r;i++)
        {
            int ans=F(i);
            if(ans<minn)
                minn=ans;
            if(ans>maxx)
                maxx=ans;
        }
        printf("%d %d\n",maxx,minn);
    }
    return 0;
}