#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#include <atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
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 mx = -(1LL<<60), mn=1LL<<60;
  ll mxp=0,mnp=0;
  for(ll x=p;x<=q;x++){
    if(chmax(mx,f(x))) mxp=x;
    if(chmin(mn,f(x))) mnp=x;
  }
  cout << mx << ' ' << mxp << ' ' << mn << ' ' << mnp << endl;
  return 0;
}