Perfect numbers
Easy
Execution time limit is 5 seconds
Runtime memory usage limit is 64 megabytes
Number is called perfect if it equals the sum of all its divisors smaller than himself. Want to find all the perfect numbers from M to N.
Input
In the first row are separated by a space of M and N.
M и N целые; 1 ≤ M ≤ N ≤ 10^9; (N - M)·Sqrt(N) ≤ 10^7.
Output
In each row to derive one number in ascending order. If the perfect numbers in the interval not to withdraw "Absent".
Examples
Input #1
Answer #1
Submissions 3K
Acceptance rate 19%