B"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: 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!). The first line of the input contains one integer q ( 1 <= q <= 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 <= n_i, m_i, k_i <= 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. 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. 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 rea"...