Anti-knapsack

You are given two integers $N$ and $K$. Construct an array $A$ consisting of $N$ **distinct** positive integers such that the following conditions are met: - $1 \leq A_i \leq 2 \cdot 10^4;$ - There exists **no** [subsequence](https://en.wikipedia.org/wiki/Subsequence) of $A$ with sum $K$. It can be shown that the answer always exists. ### Input - The first line contains a single integer $T$: t