## Description:

In this problem, ‘lattice points’ in the plane are points with integer coordinates.

In order to contain his cows, Farmer John constructs a triangular electric fence by stringing a ‘hot’ wire from the origin (0,0) to a lattice point [n, m] (0<=;n<32000, 0<m<32000), then to a lattice point on the positive x axis [p,0] (p>0), and then back to the origin (0,0).

A cow can be placed at each lattice point within the fence without touching the fence (very thin cows). Cows can not be placed on lattice points that the fence touches. How many cows can a given fence hold?

## Input:

First line contains an integer n: the number of test case.

Then n lines follow, each line contains three space-separated integers that denote n, m, and p.

## Output:

A single line with a single integer for each test case that represents the number of cows the specified fence can hold.

## Sample Input:

2

7 5 10

1 1 2

## Sample Output:

20

0

## Note:

本题由旧版NOJ导入，来源：NUPT ACM 2010 Personal Ranking Contest