In mathematical terms, the sequence Fn of Fibonacci numbers is defined by the recurrence relation
F
n = F
n-1 + F
n-2with seed values F
1 = 1; F
2 = 1 (sequence A000045 in OEIS).
---Wikipedia
Today, Fibonacci takes revenge on you. Now the first two elements of Fibonacci sequence has been redefined as A and B. You have to check if C is in the new Fibonacci sequence.
The first line contains a single integer T, indicating the number of test cases.
Each test case only contains three integers A, B and C.
[Technical Specification]
1. 1 <= T <= 100
2. 1 <= A, B, C <= 1 000 000 000
For each test case, output “Yes” if C is in the new Fibonacci sequence, otherwise “No”.