Plus or Minus

A. Plus or Minus

Problem

Input

The first line contains a single integer $t$ ($1\le t\le 162$) — the number of test cases.

The description of each test case consists of three integers $a$, $b$, $c$ ($1\le a,b\le 9$, $-8\le c\le 18$). The additional constraint on the input: it will be generated so that exactly one of the two equations will be true.You are given three integers $a$, $b$, and $c$ such that exactly one of these two equations is true:

• $a+b=c$
• $a-b=c$

Output + if the first equation is true, and - otherwise.

Output

For each test case, output either + or - on a new line, representing the correct equation.

Example

Input

11
1 2 3
3 2 1
2 9 -7
3 4 7
1 1 2
1 1 0
3 3 6
9 9 18
9 9 0
1 9 -8
1 9 10

Output

+
-
-
+
+
-
+
+
-
-
+

Note

In the first test case, $1+2=3$.

In the second test case, $3-2=1$.

In the third test case, $2-9=-7$. Note that $c$ can be negative.

Code

// #include <iostream>
// #include <algorithm>
// #include <cstring>
// #include <stack>//栈
// #include <deque>//堆/优先队列
// #include <queue>//队列
// #include <map>//映射
// #include <unordered_map>//哈希表
// #include <vector>//容器，存数组的数，表数组的长度
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

void solve()
{
    ll a,b,c;
    cin>>a>>b>>c;

    if(a+b==c) cout<<"+"<<endl;
    else cout<<"-"<<endl;
}

int main()
{
    ll t;
    cin>>t;

    while(t--) solve();

    return 0;
}