#[allow(unused_macros)]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        let mut next = || { iter.next().unwrap() };
        input_inner!{next, $($r)*}
    };
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };

    ($next:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, bytes) => {
        read_value!($next, String).into_bytes()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}
mod vig {
    pub trait S {
        fn binary_search(&self, f: &Fn(u64)->bool) -> u64;
    }
    impl S for Vec<u64> {
        fn binary_search(&self, f: &Fn(u64)->bool) -> u64 {
            let mut ng: u64 = self[0];
            let mut ok: u64 = self[1];
            loop {
                if ok as i64 - ng as i64 <= 1 {
                    break;
                }
                let mid = (ok + ng) / 2;
                if f(mid) {
                    ok = mid;
                } else {
                    ng = mid;
                }
            }
            ok
        }
    }
}

fn main() {
    input!{
        p:u64,
        q:u64,
        r:u64,
        a:u64,
        b:u64,
        c:u64,
    }
    let down = std::cmp::max(p*(a-1), std::cmp::max(q*(a+b-1), r*(a+b+c-1)));
    let up = std::cmp::min(p*a, std::cmp::min(q*(a+b), r*(a+b+c)));
    // let mut tdown = down;
    // println!("{} {} {}", p*a, q*b, r*c);
    // println!("{}", vec![down..up]);
    
    if down < up {
        let tdown = vig::S::binary_search(&vec![down,up], &|i: u64|{ ((i+p-1)/p == a && (i+q-1)/q == a+b && (i+r-1)/r==a+b+c)} );
        println!("{} {}",tdown, up);
    }else{
        println!("-1");
    }
}