FRIENDLY NUMBERS#7461
Two distinct natural numbers are termed amicable if the first number is equal to the sum of the proper divisors of the second number, and the second number is equal to the sum of the proper divisors of the first number. Your task is to identify all pairs of amicable numbers where both numbers fall within the range from to (1 \le M \le N \le 1\,000\,000), with all numbers being integers.
The input consists of a single line containing two integers, and , separated by a space.
For each pair of amicable numbers, output a line containing the two numbers separated by a space, ensuring the first number is smaller than the second. The output should be sorted in ascending order based on the first number of each pair. If no amicable numbers are found within the specified range, output "**Absent**".
Example 1
Example 2
Example 3