#include #define all(vec) vec.begin(), vec.end() using namespace std; using ll = long long; using P = pair; constexpr ll INF = (1LL << 30) - 1LL; constexpr ll LINF = (1LL << 60) - 1LL; constexpr double eps = 1e-9; constexpr ll MOD = 1000000007LL; template bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }; template bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }; template ostream& operator<<(ostream& os, vector v) { for(int i = 0; i < v.size(); i++) { os << v[i] << (i + 1 == v.size() ? "\n" : " "); } return os; } template vector make_v(size_t a) { return vector(a); } template auto make_v(size_t a, Ts... ts) { return vector(ts...))>(a, make_v(ts...)); } template typename enable_if::value == 0>::type fill_v(T& t, const V& v) { t = v; } template typename enable_if::value != 0>::type fill_v(T& t, const V& v) { for(auto& e : t) { fill_v(e, v); } }; int main() { cin.tie(0); ios::sync_with_stdio(false); ll p, q, r, a, b, c; cin >> p >> q >> r >> a >> b >> c; ll mi = (a - 1LL) * p, ma = a * p; chmax(mi, (a + b - 1LL) * q); chmin(ma, (a + b) * q); chmax(mi, (a + b + c - 1LL) * r); chmin(ma, (a + b + c) * r); if(mi >= ma) { cout << -1 << endl; } else { cout << mi + 1LL << " " << ma << endl; } }