#include <bits/stdc++.h>
using namespace std;
using LL = long long int;
#define incID(i, l, r) for(int i = (l)    ; i <  (r); ++i)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); --i)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); ++i)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); --i)
#define inc(i, n)  incID(i, 0, n)
#define dec(i, n)  decID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec1(i, n) decII(i, 1, n)
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))
#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define MT make_tuple
#define FI first
#define SE second
#define FR front()
#define BA back()
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
auto setmin   = [](auto & a, auto b) { return (b <  a ? a = b, true : false); };
auto setmax   = [](auto & a, auto b) { return (b >  a ? a = b, true : false); };
auto setmineq = [](auto & a, auto b) { return (b <= a ? a = b, true : false); };
auto setmaxeq = [](auto & a, auto b) { return (b >= a ? a = b, true : false); };
#define SI(v) static_cast<int>(v.size())
#define RF(e, v) for(auto & e: v)
#define until(e) while(! (e))
#define if_not(e) if(! (e))
#define ef else if
#define UR assert(false)

template<typename T, typename U> istream & operator>>(istream & s, pair<T, U> & p) { return (s >> p.FI >> p.SE); }
template<typename T, typename U> ostream & operator<<(ostream & s, pair<T, U> const & p) { return (s << p.FI << " " << p.SE); }

#define IN(T, ...) T __VA_ARGS__; IN_(__VA_ARGS__);
void IN_() { };
template<typename T, typename ... U> void IN_(T &  a, U &  ... b) { cin >> a; IN_(b ...); };
template<typename T                > void OUT(T && a            ) { cout << a << endl; }
template<typename T, typename ... U> void OUT(T && a, U && ... b) { cout << a << " "; OUT(b ...); }

// ---- ----

template<typename T> class opt {
private:
	bool f;
	T v;
public:
	opt() { f = false; }
	opt(T v) : v(v) { f = true; }
	void reset() { f = false; }
	bool setmin  (T a) { return (! f || a <  v ? v = a, f = true : false); }
	bool setmax  (T a) { return (! f || a >  v ? v = a, f = true : false); }
	bool setmineq(T a) { return (! f || a <= v ? v = a, f = true : false); }
	bool setmaxeq(T a) { return (! f || a >= v ? v = a, f = true : false); }
	bool has_val() { return f; }
	bool is_null() { return ! f; }
	T & val() { assert(f); return v; }
	friend T operator||(opt a, T e) { return (a.f ? a.v : e); }
	friend istream & operator>>(istream & s, opt<T> & a) { a.f = true; return (s >> a.v); }
	friend ostream & operator<<(ostream & s, opt<T>   a) { return (a.f ? s << a.v : s << "[null]"); }
};

int main() {
	IN(int, a, b, c, d, p, q);
	auto f = [&](int x) { return a*x*x*x + b*x*x + c*x + d; };
	opt<pair<int, int>> ma, mi;
	incII(x, p, q) {
		ma.setmax({ f(x), -x });
		mi.setmin({ f(x), +x });
	}
	ma.val().SE *= -1;
	OUT(ma.val(), mi.val());
}