#include <bits/stdc++.h>
using namespace std;
const long long N = 1001;
const long long MX = -1e9 - 3;
const long long MN = 1e9 + 3;
long long n, m, cnt, ans, x, y, mx = MX, mn = MN, a, b, c;
float p = 3.14159, k;
bool bl, bl1;
string str, s;
map<long long, long long> mp;
vector<long long> v, q, g[N];
bool used[N];
pair<char, long long> pr[N];
pair<long long, char> pr1[N];
long long ar[1001];
void dfs(long long v) {
  used[v] = true;
  for (long long i = 0; i < g[v].size(); i++) {
    long long to = g[v][i];
    if (!used[to]) {
      dfs(to);
    }
  }
}
int main() {
  cin >> a >> b >> c;
  if (a == b) {
    if (c == 0)
      cout << "0";
    else
      cout << "?";
  } else {
    if (a > b) {
      if (b + c < a)
        cout << "+";
      else
        cout << "?";
    } else if (b > a) {
      if (a + c < b)
        cout << "-";
      else
        cout << "?";
    }
  }
  cout << "\n";
  return 0;
}
