#pragma comment(linker, "/STACK:1677721600")
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <bitset>
#include <vector>
#include <cstdio>
#include <string>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
#define sf scanf
#define pf printf
#define INF 0x3f3f3f3f
#define mem0(a) memset(a,0,sizeof(a))
#define mem_1(a) memset(a,-1,sizeof(a))
#define FIN freopen("in.txt", "r", stdin)
#define FOUT freopen("out.txt", "w", stdout)

template <class T>
inline bool in(T &ret) {
    char c; int sgn;
    if (c=getchar(),c==EOF) return 0;
    while (c!='-'&&(c<'0'||c>'9')) c=getchar();
    sgn=(c=='-')?-1:1;
    ret=(c=='-')?0:(c-'0');
    while(c=getchar(),c>='0'&&c<='9') ret=ret*10+(c-'0');
    ret*=sgn;
    return 1;
}
template <class T>
inline void out(T x) {
    if(x<0){
        putchar('-');
        x=-x;
    }
    if(x>9) out(x/10);
    putchar(x%10+'0');
}

template<class T> T MAX(T a, T b) { return a > b ? a : b; }
template<class T> T MIN(T a, T b) { return a < b ? a : b; }
template<class T> T GCD(T a, T b) { return b ? GCD(b, a%b) : a; }
template<class T> T LCM(T a, T b) { return a / GCD(a,b) * b;    }

typedef long long LL;
typedef unsigned long long ULL;

const int MAXN = 50 + 10;
const int MAXM = 50 + 10;
const double eps = 1e-8;
LL MOD = 1000000007;

int a,b,c;

int re(int e){
    return a*e*e+b*e+c;
}



int main(){
    //FIN ;
    //FOUT; 
    //cout<<int(-3.2)<<endl;
    int T;
    cin>>T;
    while(T--){
        int l,r;
        cin>>a>>b>>c>>l>>r;
        
        int ma=re(l);
        int mi=re(r);
        for(int i=l;i<=r;i++){
            ma=MAX(ma,re(i));
            mi=MIN(mi,re(i));
        }
        
        cout<<ma<<' '<<mi;
        cout<<endl;
        
        
    } 
    
    
    
    
    return 0;
}

/*
1
1 1 1 1 2


*/