#include #define rep(i,n) for(int i = 0; i < (n); ++i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) using namespace std; typedef long long int ll; typedef pair P; #define yn {puts("YES");}else{puts("NO");} #define MAX_N 200005 int main() { int a, b, c, d, p, q; cin >> a >> b >> c >> d >> p >> q; int ma = -2e9, argma = -1000; int mi = 2e9, argmi = -1000; srep(i,p,q+1){ int tmp = a*i*i*i + b*i*i + c*i + d; if(ma < tmp){ argma = i; ma = tmp; } if(tmp < mi){ argmi = i; mi = tmp; } } cout << ma << ' ' << argma << ' ' << mi << ' ' << argmi << endl; return 0; }