eolymp
bolt
Try our new interface for solving problems
Problems

Friendly numbers

Friendly numbers

Time limit 1 second
Memory limit 64 MiB

Two different natural numbers are called friendly if the first one is the sum of divisors of the second number, with the exception of the second number, and the second is the sum of divisors of the first day, except for the very first day. Want to find all the pairs of friendly numbers, both of which belong to the interval from M to N.

Input data

In the first row are integers M and N (1  ≤ M ≤ N ≤ 1 000 000).

Output data

In each line of output from a pair of numbers separated by spaces. The first number pair must be less than the second. Rows must be sorted in ascending order of the first of the pair. If the pairs of friendly numbers in the interval not to withdraw "Absent".

Examples

Input example #1
200 300
Output example #1
220 284