Alice = Bob - Repovive Premier Round 2 | Repovive

3A. Alice = Bob

500 pts1s256 MB

You are given three integers $a$ , $b$ , and $c$ .

Alice initially has $a$ apples and Bob initially has $b$ apples. You also have $c$ additional apples, and each of these $c$ apples must be given to exactly one of them (either Alice or Bob).

For each test case, determine whether it is possible to distribute the $c$ apples so that finally Alice and Bob have the same number of apples.

Constraints

$1 \le t \le 10^3$
$0 \le a, b, c \le 10^9$

Input

t

\left. \begin{array}{l} a \quad b \quad c \end{array} \right\} \times t

Output

$\left. \begin{array}{l} \text{ans} \end{array} \right\} \times t$

where $\text{ans}$ is either Yes or No.

Samples

Input

Case 1

7 3 4

Case 2

7 3 3

Case 3

7 8 5

Case 4

8 3 6

Explanation

Case 1

Give all $4$ apples to Bob.

Case 2

It is impossible.

Case 3

Give $3$ apples to Alice and $2$ apples to Bob.

Case 4

It is impossible.

Output

Case 1

Yes

Case 2

No

Case 3

Yes

Case 4

No

You are given three integers $a$ , $b$ , and $c$ .

Alice initially has $a$ apples and Bob initially has $b$ apples. You also have $c$ additional apples, and each of these $c$ apples must be given to exactly one of them (either Alice or Bob).

For each test case, determine whether it is possible to distribute the $c$ apples so that finally Alice and Bob have the same number of apples.

Constraints

$1 \le t \le 10^3$
$0 \le a, b, c \le 10^9$

t

\left. \begin{array}{l} a \quad b \quad c \end{array} \right\} \times t

$\left. \begin{array}{l} \text{ans} \end{array} \right\} \times t$

where $\text{ans}$ is either Yes or No.

Give $3$ apples to Alice and $2$ apples to Bob.

My submissions

Announcements

My submissions

Announcements

My submissions

Announcements

My submissions

Announcements

3A. Alice = Bob

Input

Output

Samples

3A. Alice = Bob

Constraints

Input

Output

Samples

Constraints