Grimm's Hypothesis#3703
Grimm's conjecture in number theory suggests that each number in a continuous sequence of composite numbers can be uniquely associated with a prime divisor. Your task is to establish this correspondence.
The input consists of two consecutive prime numbers, p_1 and p_2, separated by a single space. It is guaranteed that all numbers between p_1 and p_2 are composite (2 \leq p_1 < p_2 \leq 10^9).
Output a single line containing p_2-p_1-1 distinct prime numbers, each separated by a single space. These primes should be divisors of the numbers p_1+1, ..., p_2-1, respectively.
Örnek 1