import java.io.PrintWriter
import java.util.*
import kotlin.math.*

fun PrintWriter.solve() {
    val x = nextLong()
    val a = nextLong()
    val y = nextLong()
    val b = nextLong()
    // region prime factorization
    var number = x
    var divisor = 2L
    val pf = mutableMapOf<Long, Long>()
    while (divisor * divisor <= number) {
        var count = 0
        while (number % divisor == 0L) {
            number /= divisor
            count++
        }
        if (count > 0) {
            pf[divisor] = count * a
        }
        divisor++
    }
    if (number > 1) pf[number] = a
    // endregion
    // region prime factorization
    number = y
    divisor = 2L
    val pf2 = mutableMapOf<Long, Long>()
    while (divisor * divisor <= number) {
        var count = 0
        while (number % divisor == 0L) {
            number /= divisor
            count++
        }
        if (count > 0) {
            pf2[divisor] = count * b
        }
        divisor++
    }
    if (number > 1) pf2[number] = b
    // endregion
    for (k in pf2.keys) {
        if (!pf.containsKey(k)) {
            pf[k] = 0
        }
    }
    if (pf.keys.all { pf[it]!! >= pf2[it] ?: 0 }) {
        println("Yes")
    } else {
        println("No")
    }
}

fun main() {
    Thread(null, {
        val writer = PrintWriter(System.out, false)
        writer.solve()
        writer.flush()
    }, "solve", abs(1L.shl(26)))
        .apply { setUncaughtExceptionHandler { _, e -> e.printStackTrace(); kotlin.system.exitProcess(1) } }
        .apply { start() }.join()
}

// region Scanner
private var st = StringTokenizer("")
private val br = System.`in`.bufferedReader()

fun next(): String {
    while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine())
    return st.nextToken()
}

fun nextInt() = next().toInt()
fun nextLong() = next().toLong()
fun nextLine() = br.readLine()
fun nextDouble() = next().toDouble()
// endregion