Filling Trominos

Your task is to fill an n \times m grid using L-trominos (three squares that have an L-shape). For example, here is one way to fill a 4 \times 6 grid: Input The first input line has an integer t: the number of tests. After that, there are t lines that describe the tests. Each line has two integers n and m. Output For each test, print YES if there is a solution, and NO otherwise. If there is