CF Educational Codeforces Round 50 (Rated for Div. 2) B Diagonal Walking v.2 ʕ •ᴥ•ʔ

B. Diagonal Walking v.2

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Mikhail walks on a Cartesian plane. He starts at the point $$$(0, 0)$$$, and in one move he can go to any of eight adjacent points. For example, if Mikhail is currently at the point $$$(0, 0)$$$, he can go to any of the following points in one move:

• $$$(1, 0)$$$;
• $$$(1, 1)$$$;
• $$$(0, 1)$$$;
• $$$(-1, 1)$$$;
• $$$(-1, 0)$$$;
• $$$(-1, -1)$$$;
• $$$(0, -1)$$$;
• $$$(1, -1)$$$.

If Mikhail goes from the point $$$(x1, y1)$$$ to the point $$$(x2, y2)$$$ in one move, and $$$x1 \ne x2$$$ and $$$y1 \ne y2$$$, then such a move is called a diagonal move.

Mikhail has $$$q$$$ queries. For the $$$i$$$-th query Mikhail's target is to go to the point $$$(n_i, m_i)$$$ from the point $$$(0, 0)$$$ in exactly $$$k_i$$$ moves. Among all possible movements he want to choose one with the maximum number of diagonal moves. Your task is to find the maximum number of diagonal moves or find that it is impossible to go from the point $$$(0, 0)$$$ to the point $$$(n_i, m_i)$$$ in $$$k_i$$$ moves.

Note that Mikhail can visit any point any number of times (even the destination point!).

Input

The first line of the input contains one integer $$$q$$$ ($$$1 \le q \le 10^4$$$) — the number of queries.

Then $$$q$$$ lines follow. The $$$i$$$-th of these $$$q$$$ lines contains three integers $$$n_i$$$, $$$m_i$$$ and $$$k_i$$$ ($$$1 \le n_i, m_i, k_i \le 10^{18}$$$) — $$$x$$$-coordinate of the destination point of the query, $$$y$$$-coordinate of the destination point of the query and the number of moves in the query, correspondingly.

Output

Print $$$q$$$ integers. The $$$i$$$-th integer should be equal to -1 if Mikhail cannot go from the point $$$(0, 0)$$$ to the point $$$(n_i, m_i)$$$ in exactly $$$k_i$$$ moves described above. Otherwise the $$$i$$$-th integer should be equal to the the maximum number of diagonal moves among all possible movements.

Example

Input

3
2 2 3
4 3 7
10 1 9

Output

1
6
-1

Note

One of the possible answers to the first test case: $$$(0, 0) \to (1, 0) \to (1, 1) \to (2, 2)$$$.

One of the possible answers to the second test case: $$$(0, 0) \to (0, 1) \to (1, 2) \to (0, 3) \to (1, 4) \to (2, 3) \to (3, 2) \to (4, 3)$$$.

In the third test case Mikhail cannot reach the point $$$(10, 1)$$$ in 9 moves.

题意：给你q组样例，每组样例3个数，分别是某点的 x,y 轴的坐标 以及你需要走K步 从（0，0）出发如果K步没办法到达（x，y）输出 -1 否则输出最多可以走多少次对角线

 

 

 

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define ll long long
using namespace std;
int main()
{
	int t;
	cin>>t;
	while(t--)
	{
		ll n,m,k;
		cin>>n>>m>>k;
		if(n>k||m>k)// 如果这个点的横 纵坐标大于K 说明没办法到达这个点 
		{
			cout<<-1<<endl;
			continue;
		}
		int kk=max(n,m)-min(n,m);// 方块到三角形的距离
		if(kk%2) // 距离为奇数  根据图可以知 最多可以走 k-1 条对角线 
		{
			cout<<k-1<<endl;
		}
		else // 如果距离为偶数 根据 剩余步数的奇偶判断 
		{
			int kkk=k-min(n,m);
			if(kkk%2)// 如果剩余步数为奇数 (看图) 
			{
				cout<<k-2<<endl;
			}
			else 
			{
				cout<<k<<endl;
			}
			
		}
	}
	return 0;
}