SP10334 SOLDIERS - SOLDIERS

**Soldiers** **Problem Statement:** How many maximum number of soldiers(chess) can be placed in a mxn board so that none of them attack the other. **Input Specification:** The first line is an integer t, denoting the number of test cases. Each test case is a single line with two integers m and n the number of rows and columns in the board. **Output Specification:** For each test case print the maximum number of soldiers that can be placed in a separate line. **Input Constraints:** 1

N/A

N/A