#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
bool is_op(char c) {
	return c == '+' || c == '-';
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int t; cin >> t;
	while (t--) {
		string s; cin >> s;
		bool minus = false;
		rep(i, s.size()) {
			if (s[i] == '+') {
				minus = false;
			}
			else if (s[i] == '-') {
				minus = true;
			}
			else if (s[i] == '?') {
				if (minus) {
					if (i == s.size() - 1 || is_op(s[i - 1]) || is_op(s[i + 1])) {
						s[i] = '1';
					}
					else {
						minus = false;
						s[i] = '+';
					}
				}
				else {
					s[i] = '9';
				}
			}
		}
		cout << s << endl;
	}
	return 0;
}