#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline int my_getchar_unlocked(){
  static char buf[1048576];
  static int s = 1048576;
  static int e = 1048576;
  if(s == e && e == 1048576){
    e = fread_unlocked(buf, 1, 1048576, stdin);
    s = 0;
  }
  if(s == e){
    return EOF;
  }
  return buf[s++];
}
inline void rd(int &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
struct MY_WRITER{
  char buf[1048576];
  int s;
  int e;
  MY_WRITER(){
    s = 0;
    e = 1048576;
  }
  ~MY_WRITER(){
    if(s){
      fwrite_unlocked(buf, 1, s, stdout);
    }
  }
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar_unlocked(int a){
  if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
    fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);
    MY_WRITER_VAR.s = 0;
  }
  MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;
}
inline void wt_L(char a){
  my_putchar_unlocked(a);
}
inline void wt_L(long long x){
  int s=0;
  int m=0;
  char f[20];
  if(x<0){
    m=1;
    x=-x;
  }
  while(x){
    f[s++]=x%10;
    x/=10;
  }
  if(!s){
    f[s++]=0;
  }
  if(m){
    my_putchar_unlocked('-');
  }
  while(s--){
    my_putchar_unlocked(f[s]+'0');
  }
}
int A;
int B;
int C;
int D;
int P;
int Q;
long long f(long long x){
  return A*x*x*x + B*x*x + C*x + D;
}
int main(){
  int i;
  long long mx1;
  long long mx2 = -4611686016279904256LL;
  long long mn1;
  long long mn2 = 4611686016279904256LL;
  long long tmp;
  rd(A);
  rd(B);
  rd(C);
  rd(D);
  rd(P);
  rd(Q);
  for(i=(P);i<(Q+1);i++){
    tmp = f(i);
    if(mx2 < tmp){
      mx1 = i;
      mx2 = tmp;
    }
    if(mn2 > tmp){
      mn1 = i;
      mn2 = tmp;
    }
  }
  wt_L(mx2);
  wt_L(' ');
  wt_L(mx1);
  wt_L(' ');
  wt_L(mn2);
  wt_L(' ');
  wt_L(mn1);
  wt_L('\n');
  return 0;
}
// cLay varsion 20200509-1

// --- original code ---
// int A, B, C, D, P, Q;
// 
// ll f(ll x){
//   return A*x*x*x + B*x*x + C*x + D;
// }
// 
// {
//   ll mx1, mx2 = -ll_inf, mn1, mn2 = ll_inf, tmp;
//   rd(A,B,C,D,P,Q);
//   rep(i,P,Q+1){
//     tmp = f(i);
//     if(mx2 < tmp) mx1 = i, mx2 = tmp;
//     if(mn2 > tmp) mn1 = i, mn2 = tmp;
//   }
//   wt(mx2,mx1,mn2,mn1);
// }