시간 제한메모리 제한제출정답맞힌 사람정답 비율
2 초 512 MB105302628.261%

## 문제

Bessie rubbed her eyes again. "The headache's gone. Can you go over that part about number chains again, Farmer John?"

"Sure!" FJ exclaimed. "Let's continue with that sigma function, the one that is the sum of a number's divisors. First, though, let's exclude the number itself from the sum and call our new function bess(), in your honor. Now bess(12) = 1+2+3+4+6 = 16. If we continue and compute bess(16), we find it is 1 + 2 + 4 + 8 = 15. Then bess(15) = 1 + 3 + 5 = 9 and bess(9) = 1 + 3 = 4. Then bess(4) = 1 + 2 = 3 and bess(3) = 1. For better or worse, bess(1) is 0. Not much of a chain, really."

"But look," continued FJ. "We see that bess(6) = 1 + 2 + 3 = 6 and bess(28) = 28. Those form little tiny chains called 'perfect numbers'. Moving to bigger numbers, bess(220) = 284 and -- get this -- bess(284) = 220 -- a chain of length 2! Some chains are even longer."

"It's so late; I'm not sure I can do the math," mooed Bessie.

"No problem," said FJ. "We'll ask the programmers to write a program that accepts a start and end integer (1 <= start <= end <= 1,000,000) and finds all the possible number chains whose starting value is in the interval (start..end). No intermediate value is allowed to exceed 2,000,000, though some might be larger than the 'end' integer. No chain is longer than 50 elements. Print only chains whose smallest element comes first (i.e., no intermediate value is less than the start value of the chain). We must ask them, though, to compute the answers with their program and not just print them. We'll supply test data that is reasonable to finish in 1.0 CPU seconds."

## 입력

• Line 1: Two space-separated integers: start and end

## 출력

• Lines 1..?: Each line contains a space-separated list that represents one chain of numbers calculated using the described bess() function.

## 예제 입력 1

200 1200


## 예제 출력 1

220 284
496
1184 1210