For this Question: The universe contains a magic number <b>z</b>. Thor's power is known to <b>x</b> and Loki's power to be <b>y</b>.

One's strength is defined to be <b>z - a</b>, if his power is <b>a</b>. Your task is to find out who among Thor and Loki has the highest strength, and print that strength.

<b>Note:</b> The input and answer may not fit in a 32-bit integer type. In particular, if you are using C++ consider using <em>long long int</em> over <em>int</em>.The first line contains one integer t — the number of test cases. 
Each test case consists of one line containing three space-separated integers x, y and z.

<b> Constraints: </b>
1 ≤ t ≤ 10<sup>4</sup>
1 ≤ x, y ≤ 10<sup>15</sup>
max(x, y) < z ≤ 10<sup>15</sup>For each test case, print a single value - the largest strength among Thor and Loki.Sample Input
2
2 3 4
1 1 5

Sample Output
2
4, I have written this Solution Code: #include<bits/stdc++.h>

using namespace std;

#define int long long


void solve()
{
	int t;
	cin>>t;
	while(t--)
	{
		int x, y, z;
		cin>>x>>y>>z;

		cout<<max(z - y, z- x)<<endl;
	}
}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cerr.tie(NULL);

	#ifndef ONLINE_JUDGE
	    if (fopen("INPUT.txt", "r"))
	    {
	        freopen("INPUT.txt", "r", stdin);
	        freopen("OUTPUT.txt", "w", stdout);

	    }
	#endif

	solve();



}, In this Programming Language: C++, Now tell me if this Code is compilable or not?