Score : 400 points
Given are three integers N, K, and S.
Find a sequence A_1, A_2, ..., A_N of N integers between 1 and 10^9 (inclusive) that satisfies the condition below. We can prove that, under the conditions in Constraints, such a sequence always exists.
Input is given from Standard Input in the following format:
N K S
Print a sequence satisfying the condition, in the following format:
A_1 A_2 ... A_N
4 2 3
1 2 3 4
Two pairs (l, r) = (1, 2) and (3, 3) satisfy the condition in the statement.
5 3 100
50 50 50 30 70