#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

void solve() {
  string s;
  cin >> s;
  ll n = s.size();
  bool pos = true, sign = false;
  for (ll i = 0; i < n; i++) {
    if (s[i] == '+') {
      pos = true;
      sign = true;
      continue;
    }
    if (s[i] == '-') {
      pos = false;
      sign = true;
      continue;
    }
    if (s[i] != '?') {
      sign = false;
      continue;
    }
    if (pos) {
      s[i] = '9';
      sign = false;
      continue;
    }
    if (sign || i == n - 1 || s[i + 1] == '+' || s[i + 1] == '-') {
      s[i] = '1';
      sign = false;
      continue;
    }
    s[i] = '+';
    pos = true;
    sign = true;
  }
  cout << s << '\n';
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  cin >> T;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}