Amicable numbers#854
Two distinct natural numbers are called amicable if the first is equal to the sum of the divisors of the second number, excluding the second number itself, and the second is equal to the sum of the divisors of the first number, excluding the first number itself. You are required to find all pairs of amicable numbers where both numbers belong to the interval from to .
The first line contains the integers and (1 \leq M \leq N \leq 1\,000\,000).
Output each pair of numbers, separated by a space, on a separate line. The first number in each pair must be less than the second. The lines must be sorted in ascending order of the first number in each pair. If there are no pairs of amicable numbers in the interval, output Absent.
Example 1