/*
  PROB:t1
  TIME:20151212 eve
  #define me AcrossTheSky
  good good study,day day up!
*/
#include <cstdio>
#include <cmath>

#include <ctime>
#include <string>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>

#include <set>
#include <map>
#include <stack>
#include <queue>
#include <vector>
#define lowbit(x) (x)&(-x) 
using namespace std;
typedef long long ll;
ll a,b,c,l,r;

ll calc(ll x){
    return (a*x*x+b*x+c);
}

int main(){
    int cas;
    scanf("%d",&cas);
    
    while (cas){
        //int a,b,c,l,r;
        int max=-1<<30,min=1<<30;
        cin >> a >> b >> c >> l >> r;
        for (int i=l;i<=r;i++) {
            int x=calc(i);
            if (x>max) max=x;
            if (x<min) min=x;
        }
        cout << max <<  " " << min << endl;
        cas--;
    }
    return 0;
}