pub mod io { pub fn scan(r: &mut R) -> Vec { let mut res = Vec::new(); loop { let buf = match r.fill_buf() { Ok(buf) => buf, Err(e) if e.kind() == std::io::ErrorKind::Interrupted => continue, Err(e) => panic!("{}", e), }; let (done, used, buf) = match buf.iter().position(u8::is_ascii_whitespace) { Some(i) => (i > 0 || res.len() > 0, i + 1, &buf[..i]), None => (buf.is_empty(), buf.len(), buf), }; res.extend_from_slice(buf); r.consume(used); if done { return res; } } } #[macro_export] macro_rules! scan { ($r:expr, [$t:tt; $n:expr]) => ((0..$n).map(|_| scan!($r, $t)).collect::>()); ($r:expr, [$t:tt]) => (scan!($r, [$t; scan!($r, usize)])); ($r:expr, ($($t:tt),*)) => (($(scan!($r, $t)),*)); ($r:expr, Usize1) => (scan!($r, usize) - 1); ($r:expr, String) => (String::from_utf8(scan!($r, Bytes)).unwrap()); ($r:expr, Bytes) => (io::scan($r)); ($r:expr, $t:ty) => (scan!($r, String).parse::<$t>().unwrap()); } #[macro_export] macro_rules! input { ($r:expr, $($($v:ident)* : $t:tt),* $(,)?) => { $(let $($v)* = scan!($r, $t);)* }; } } pub fn prime_factorize(mut n: u64) -> Vec<(u64, u64)> { let mut res = Vec::new(); for i in 2.. { if i * i > n { break; } let mut cnt = 0; while n % i == 0 { cnt += 1; n /= i; } if cnt > 0 { res.push((i, cnt)); } } if n > 1 { res.push((n, 1)); } res } fn run(reader: &mut R, writer: &mut W) { input! { reader, x: u64, a: u64, y: u64, b: u64, } if y == 1 { writeln!(writer, "Yes").ok(); return; } let xpf = prime_factorize(x); let ypf = prime_factorize(y); let mut i = 0; for (p2, c2) in ypf { while i < xpf.len() && xpf[i].0 < p2 { i += 1; } if i == xpf.len() { writeln!(writer, "No").ok(); return; } let (p1, c1) = xpf[i]; if p1 != p2 || c1 * a < c2 * b { writeln!(writer, "No").ok(); return; } i += 1; } writeln!(writer, "Yes").ok(); } fn main() { let (stdin, stdout) = (std::io::stdin(), std::io::stdout()); let ref mut reader = std::io::BufReader::new(stdin.lock()); let ref mut writer = std::io::BufWriter::new(stdout.lock()); run(reader, writer); }