#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cctype>
#include<list>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<vector>

using namespace std;

#define MAX_N
const int INF = 0x3f3f3f3f;

inline int f(int a, int b, int c, int l)
{
    return a * l * l + b * l + c;
}

int main()
{
    int t;
    scanf("%d", &t);
    int a, b, c, l, r;
    while(t--)
    {
        scanf("%d%d%d%d%d", &a, &b, &c, &l, &r);
        int maxx = -INF;
        int minn = INF;
        for(int i = l ; i <= r ; i++)
        {
            int tmp = f(a, b, c, i);
//            cout<<tmp<<endl;
            minn = min(tmp, minn);
            maxx = max(tmp, maxx);
        }
        printf("%d %d\n", maxx, minn);
    }
}