#include using namespace std; typedef long long ll; #define F first #define S second #define pii pair #define eb emplace_back #define all(v) v.begin(), v.end() #define rep(i, n) for (int i = 0; i < n; ++i) #define rep3(i, l, n) for (int i = l; i < n; ++i) #define chmax(a, b) a = max(a, b) #define chmin(a, b) a = min(a, b) #define out(a) cout << a << endl int main() { ll p, q, r; cin >> p >> q >> r; ll a, b, c; cin >> a >> b >> c; ll min_n = max({(a - 1) * p, (a + b - 1) * q, (a + b + c - 1) * r}) + 1; ll max_n = min({a * p, (a + b) * q, (a + b + c) * r}); if (min_n > max_n) out(-1); //3つの区間が空集合 else out(min_n << " " << max_n); }