#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    ll a,b,c,d,p,q; cin >> a >> b >> c >> d >> p >> q;
    ll res,res2;
    ll mi=2e18,ma=-2e18;
    for(ll i=p;i<=q;i++){
        ll r=a*i*i*i+b*i*i+c*i+d;
        if(mi>r){
            mi=r;
            res=i;
        }
        if(ma<r){
            ma=r;
            res2=i;
        }
    }
    cout << ma << " " << res2 << " " << mi << " " << res << endl;
}