## Algorithm

B. Who's Opposite?
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Some number of people (this number is even) have stood in a circle. The people stand in the circle evenly. They are numbered clockwise starting from a person with the number 11. Each person is looking through the circle's center at the opposite person.

A sample of a circle of 66 persons. The orange arrows indicate who is looking at whom.

You don't know the exact number of people standing in the circle (but this number is even, no doubt). It is known that the person with the number a is looking at the person with the number b (and vice versa, of course). What is the number associated with a person being looked at by the person with the number c? If, for the specified ab, and c, no such circle exists, output -1.

Input

The first line contains one integer t (1t1041≤�≤104) — the number of test cases. Then t test cases follow.

Each test case consists of one line containing three distinct integers abc (1a,b,c1081≤�,�,�≤108).

Output

For each test case output in a separate line a single integer d — the number of the person being looked at by the person with the number c in a circle such that the person with the number a is looking at the person with the number b. If there are multiple solutions, print any of them. Output 1−1 if there's no circle meeting the given conditions.

Example
input
Copy
7
6 2 4
2 3 1
2 4 10
5 3 4
1 3 2
2 5 4
4 3 2
output
Copy
8
-1
-1
-1
4
1
-1
Note

In the first test case, there's a desired circle of 88 people. The person with the number 66 will look at the person with the number 22 and the person with the number 88 will look at the person with the number 44.

In the second test case, there's no circle meeting the conditions. If the person with the number 22 is looking at the person with the number 33, the circle consists of 22 people because these persons are neighbors. But, in this case, they must have the numbers 11 and 22, but it doesn't meet the problem's conditions.

In the third test case, the only circle with the persons with the numbers 22 and 44 looking at each other consists of 44 people. Therefore, the person with the number 1010 doesn't occur in the circle.

## Code Examples

### #1 Code Example with C++ Programming

Code - C++ Programming

#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define endl '\n'
#define debug(n) cout<<(n)<<endl;
const ll INF = 2e18 + 99;

int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);

int t;
cin>>t;
while(t--){
int a, b, c, a1, b1;
cin>>a1>>b1>>c;

a = max(a1, b1);
b = min(a1, b1);

if(a - b >= b && 2*(a - b) >= c){
if(c <= a - b){
c += (a - b);
}
else{
c -= (a - b);
}
cout<<c<<endl;
continue;
}

cout<<-1<<endl;
}

}
Copy The Code &

Input

cmd
7
6 2 4
2 3 1
2 4 10
5 3 4
1 3 2
2 5 4
4 3 2

Output

cmd
8
-1
-1
-1
4
1
-1
Advertisements

## Demonstration

Codeforcess Solution 1560-B B. Who's Opposite? ,C++, Java, Js and Python,1560-B,Codeforcess Solution