Problem: A frog is currently at the point 0 on a coordinate axis Ox. It jumps by the following algorithm: the first jump is a units to the right, the second jump is b units to the left, the third jump is a units to the right, the fourth jump is b units to the left, and so on.

Formally: 

  * if the frog has jumped an even number of times (before the current jump), it jumps from its current position x to position x+a; 
  * otherwise it jumps from its current position x to position x-b. 



Your task is to calculate the position of the frog after k jumps.

But... One more thing. You are watching t different frogs so you have to answer t independent queries.

Input

The first line of the input contains one integer t (1 ≤ t ≤ 1000) — the number of queries.

Each of the next t lines contain queries (one query per line).

The query is described as three space-separated integers a, b, k (1 ≤ a, b, k ≤ 10^9) — the lengths of two types of jumps and the number of jumps, respectively.

Output

Print t integers. The i-th integer should be the answer for the i-th query.

Example

Input


6
5 2 3
100 1 4
1 10 5
1000000000 1 6
1 1 1000000000
1 1 999999999


Output


8
198
-17
2999999997
0
1

Note

In the first query frog jumps 5 to the right, 2 to the left and 5 to the right so the answer is 5 - 2 + 5 = 8.

In the second query frog jumps 100 to the right, 1 to the left, 100 to the right and 1 to the left so the answer is 100 - 1 + 100 - 1 = 198.

In the third query the answer is 1 - 10 + 1 - 10 + 1 = -17.

In the fourth query the answer is 10^9 - 1 + 10^9 - 1 + 10^9 - 1 = 2999999997.

In the fifth query all frog's jumps are neutralized by each other so the answer is 0.

The sixth query is the same as the fifth but without the last jump so the answer is 1.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
using ll = long long;
typedef struct sol {
  ll val;
  ll h;
} sol;
typedef struct elem {
  int x1, x2, y1, y2;
  bool operator==(const elem& t) const {
    return (this->x1 == t.x1 && this->x2 == t.x2 && this->y1 == t.y1 &&
            this->y2 == t.y2);
  }
} elem;
class ElemHash {
 public:
  size_t operator()(const elem& t) const { return t.x1 + t.x2 + t.y1 + t.y2; }
};
bool sort_pr(const pair<int, int>& a, const pair<int, int>& b) {
  return (a.first <= b.first) && (a.second <= b.second);
}
bool comp_s(const vector<char>& s1, const vector<char>& s2) {
  for (int i = 0; i < s1.size(); ++i) {
    if (s1[i] == s2[i])
      continue;
    else if (s1[i] < s2[i])
      return true;
    else
      return false;
  }
  return false;
}
typedef struct node {
  char c;
  node* l;
  node* r;
} node;
int f(int x) {
  x += 1;
  while (x % 10 == 0 && x > 0) x /= 10;
  return x;
}
int main() {
  int t0;
  scanf("%d\n", &t0);
  while (t0--) {
    ll a, b, k;
    cin >> a >> b >> k;
    ll pos = 0;
    pos += (k / 2) * (a - b);
    if (k % 2) pos += a;
    cout << pos << endl;
  }
  return 0;
}