Polyhedra

Given a sphere, you can slice through the surface of the sphere to make different convex polyhedra. All of these convex polyhedra have the Euler characteristic which can be defined as follows:

where $V$ represents the number of vertices, $E$ the number of edges and $F$ the number of faces on a convex polyhedron.

Input

Begins with the number of test cases $t$ $(1\le t\le 100)$. Each test case consists of a single line with two space-separated integers $V$ and $E$ $(4\le V,E\le 100)$, representing the number of vertices and edges respectively of the convex polyhedron.

Output

For each test case, print on a single line the number of faces in the defined polyhedron.

Examples