fun main() {
    q2581()
}

fun q2581() {
    val min = readln().toInt()
    val max = readln().toInt()

    val result = (min..max).filter { isPrime(it) }
    if(result.isEmpty())
        println(-1)
    else {
        println(result.sum())
        println(result.minOf { it })
    }
}

private fun isPrime(n: Int): Boolean = when {
    n == 2 -> true
    n < 2 || n.isOdd() -> false
    else -> {
        var result = true
        for (i in 3..n/2) {
            if (n % i == 0) {
                result = false
                break
            }
        }
        result
    }
}

private fun Int.isOdd(): Boolean {
    return this % 2 == 0
}