CF1327A Sum of Odd Integers

给定 $n,k$，求是否能用 $k$ 个不同奇数的和来表示 $n$。

第一行一个数 $t(1\leq t\leq 10^5)$。 之后 $t$ 每行两个数 $n,k(1\leq n,k \leq 10^7)$

如果有解，输出"YES"，否则输出"NO"。

In the first test case, you can represent $ 3 $ as $ 3 $ . In the second test case, the only way to represent $ 4 $ is $ 1+3 $ . In the third test case, you cannot represent $ 10 $ as the sum of three distinct positive odd integers. In the fourth test case, you can represent $ 10 $ as $ 3+7 $ , for example. In the fifth test case, you can represent $ 16 $ as $ 1+3+5+7 $ . In the sixth test case, you cannot represent $ 16 $ as the sum of five distinct positive odd integers.