You are given a pair $(a,b)$ . After each unit of time, pair $(a,b)$ gets changed to $(b-a, b+a)$. You are given the initial value of pair and an integer $n$  and you have to print the value of the pair at the $n^{th}$  unit of time.

Input format

• First line: $t$ denoting the number of test cases
• Next $t$ lines: Three space-separated integers $a$, $b$, and $n$

Output format

• For each test case, print two integers (mod $10^9+7$) per line denoting the value of the pair at the $n^{th}$  unit time. 

Constraints 

$1 \le t \le 10^5$

$0 \le a \le b \le 10^9$

$1 \le n \le 10^9$