Farmer

시간 제한1초메모리 제한256 MB

요약

절댓값 차이가 x 이상인 쌍이 정확히 k개가 되도록 10^6 미만의 양의 정수 n개를 구성하고, 불가능하면 -1을 출력한다.

문제

You are given three numbers $n, k$ and $x$ . Construct an array $A$ with the following properties:

$A$ contains exactly $n$ elements.
All elements of $A$ are positive integers smaller than $10^6$ .
There are exactly $k$ pairs of indices $(i, j)$ such that: $1 \le i < j \le n$ and $|A\_i - A\_j| \geq x$ .

Single line of input contains three numbers $n$ $(1 \leq n \leq 1000)$ , $k$ $(0 \leq k \leq \frac{n\cdot (n-1)}{2})$ , $x$ $(2\leq x \leq 1000)$ .

In single line of output print $n$ integers, elements of array $A$ . In case there is no array with needed properties, print $-1$