Maximal Expression

You are given two integers $N$ and $K$. Let $F(X) = (X \bmod K)\times ((N-X)\bmod K)$, where $\bmod$ denotes the [modulo operator](https://en.wikipedia.org/wiki/Modulo). Find an integer $X$ such that the value of $F(X)$ is the **maximum** over all $0\le X \le N$. If there are multiple answers, you may print any. ### Input - The first line of input will contain a single integer $T$, denoting t