#include <bits/stdc++.h>
using namespace std;
long long bigMod(long long b, long long p) {
  if (p == 0) return 1;
  long long k = bigMod(b, p / 2);
  k = (k * k) % 1000000007;
  if (p % 2) k = (k * b) % 1000000007;
  return k;
}
int main() {
  int x, y, z;
  cin >> x >> y >> z;
  if (x + z < y)
    cout << "-" << endl;
  else if (y + z < x)
    cout << "+" << endl;
  else if (x == y && z == 0)
    cout << "0" << endl;
  else
    cout << "?" << endl;
  return 0;
}
