Bye, inversions!

Given an array $a$ of $n$ integers. You need to swap adjacent numbers exactly $k$ times. The goal is to minimise the number of inversions after exactly $k$ swaps. An inversion is a pair $(i, j)$ such that $i < j$ and $a_{i} > a_{j}$ ### Input - The first line contains an integer $T$ indicating the number of test cases. For each test case, there are two lines in total. - The first line con