Farmer

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$