#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(A) A.begin(),A.end()
using vll = vector<ll>;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using Graph = vector<vector<ll>>;
ll mod=1e9+7;
ll modPow(long long a, long long n, long long p) {
  if (n == 0) return 1; // 0乗にも対応する場合
  if (n == 1) return a % p;
  if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p;
  long long t = modPow(a, n / 2, p);
  return (t * t) % p;
}

ll stll(string S) {
    ll n = 0;
    ll k = 1;
    rep(i, S.size()) {
        n += (k * int(S[S.size() - i - 1]-'0'));
        k *= 10;
        k %= mod;
        n %= mod;
    }
    return n;
}
ll A,B,C,D,P,Q;
ll F(ll X){
  return A*X*X*X+B*X*X+C*X+D;
}
int main() {
    cin>>A>>B>>C>>D>>P>>Q;
    ll M=-1e18,XM,m=1e18,Xm;
    for(ll X=P;X<=Q;X++){
      if(F(X)>M){
        M=F(X);
        XM=X;
      }
      if(F(X)<m){
        m=F(X);
        Xm=X;
      }
    }
    
cout<<M<<" "<<XM<<" "<<m<<" "<<Xm<<endl;
}