Your task is to create a permutation of numbers $1,2,\dots,n$ that has exactly $k$ inversions.
An inversion is a pair $(a,b)$ where $a<b$ and $p_a>p_b$ where $p_i$ denotes the number at position $i$ in the permutation.
The only input line has two integers $n$ and $k$ .
Print a line that contains the permutation. You can print any valid solution.