{"raw_statement":[{"iden":"statement","content":"Let the value of a sequence be the sum of all numbers in it.\n\nDetermine whether there exists a permutation of length $n$ such that the values of all subsegments of length $k$ of the permutation share the same parity. The values share the same parity means that they are all odd numbers or they are all even numbers.\n\nA subsegment of a permutation is a contiguous subsequence of that permutation. A permutation of length $n$ is a sequence in which each integer from $1$ to $n$ appears exactly once."},{"iden":"input","content":"The first line contains one integer $T~(1\\le T \\le 10^5)$, the number of test cases.\n\nFor each test case, the only line contains two integers $n,k~(1 \\le k \\le n \\le 10^9)$."},{"iden":"output","content":"For each test case, output $\\texttt{Yes}$ (without quotes) if there exists a valid permutation, or $\\texttt{No}$ (without quotes) otherwise.\n\nYou can output $\\texttt{Yes}$ and $\\texttt{No}$ in any case (for example, strings $\\texttt{YES}$, $\\texttt{yEs}$ and $\\texttt{yes}$ will be recognized as positive responses)."},{"iden":"note","content":"In the first test case, it can be shown that there does not exist any valid permutation.\n\nIn the second test case, $[1,2,3,4]$ is one of the valid permutations. Its subsegments of length $2$ are $[1,2],[2,3],[3,4]$. Their values are $3,5,7$, respectively. They share the same parity.\n\nIn the third test case, $[1,2,3,5,4]$ is one of the valid permutations. Its subsegments of length $3$ are $[1,2,3],[2,3,5],[3,5,4]$. Their values are $6,10,12$, respectively. They share the same parity."}],"translated_statement":null,"sample_group":[["3\n3 1\n4 2\n5 3","No\nYes\nYes"]],"show_order":[],"formal_statement":null,"simple_statement":null,"has_page_source":false}