Ada's classroom contains $n \cdot m$ tables distributed in a grid with $n$ rows and $m$ columns. Each table is occupied by exactly one student. Before starting the class, the teacher decided to shuffle the students a bit. After the shuffling, each table should be occupied by exactly one student again. In addition, each student should occupy a table that is adjacent to that student's original table, i.e. immediately to the left, right, top or bottom of that table. Is it possible for the students to shuffle while satisfying all conditions of the teacher? \InputFile The first line contains the number of test cases $t$. Each of the next $t$ lines contains two integers $n$ and $m~(2 \le n, m \le 1000)$. \OutputFile For each test case, print a single line containing the string "\textbf{YES}" if it is possible to satisfy the conditions of the teacher or "\textbf{NO}" otherwise. \includegraphics{https://static.e-olymp.com/content/7d/7dcb9426f94644473066982be70fa430b0f6d929.gif}