#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

int main() {
    ll a, b, c, d, p, q;
    cin >> a >> b >> c >> d >> p >> q;
    ll M = -INF<ll>, m = INF<ll>, Mx, mx;
    for (int i = p; i <= q; ++i) {
        ll val = a*i*i*i+b*i*i+c*i+d;
        if(M < val) M = val, Mx = i;
        if(m > val) m = val, mx = i;
    }
    printf("%lld %lld %lld %lld\n", M, Mx, m, mx);
    return 0;
}