#include <bits/stdc++.h>
using namespace std;
int longestIncreasingSubsequenceDP(int a[], int n) {
  int dp[n], ans = 0;
  for (int k = 0; k < n; k++) {
    dp[k] = 1;
    for (int i = 0; i < k; i++) {
      if (a[i] <= a[k]) {
        dp[k] = max(dp[k], dp[i] + 1);
        ans = max(dp[k], ans);
      }
    }
  }
  return ans;
}
int result[1000] = {0};
int factDP(int n) {
  if (n >= 0) {
    result[0] = 1;
    for (int i = 1; i <= n; ++i) {
      result[i] = i * result[i - 1];
    }
    return result[n];
  }
}
bool checkPrime(int n) {
  if (n < 2) return false;
  for (int x = 2; x * x <= n; x++) {
    if (n % x == 0) return false;
  }
  return true;
}
vector<int> primeFactors(int n) {
  vector<int> f;
  for (int x = 2; x * x <= n; x++) {
    while (n % x == 0) {
      f.push_back(x);
      n /= x;
    }
  }
  if (n > 1) f.push_back(n);
  return f;
}
tuple<int, int, int> EuclidsAlgorithmGCD(int a, int b) {
  if (b == 0) {
    return {1, 0, a};
  } else {
    int x, y, g;
    tie(x, y, g) = EuclidsAlgorithmGCD(b, a % b);
    return {y, x - (a / b) * y, g};
  }
}
int main() {
  int x, y, z;
  cin >> x >> y >> z;
  if (x > y + z) {
    cout << "+"
         << "\n";
  } else if (y > x + z) {
    cout << "-"
         << "\n";
  } else if (x == y && z == 0) {
    cout << "0"
         << "\n";
  } else {
    cout << "?"
         << "\n";
  }
  return 0;
}
