|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||128 MB||5||0||0||0.000%|
Hackers often have to crack passwords for different data encryption systems. A novice hacker Bill faced such a problem one day. After performing several experiments he noticed regularity in the formation of an encryption key. He knew that a key is an odd integer K, such that K2does not divide (K-1)! and its value is in the range [A; B] (A ≤ K ≤ B). Note, that (K-1)! = (K-1)*(K-2)*...*2*1). He was not able to advance further due to his poor mathematics.
To help young hacker you have to find all possible values of the key.
Input consists of two integers A and B (3 ≤ A < B ≤ 1018, B - A ≤ 100).
Your program has to print to a single line of output all possible values of key K in ascending order divided by a single space. It is guaranteed that there is at least one key in the range. Key values are output in ascending order.
3 5 7
7 9 11 13