#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

// using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint;

int main() {
    ll T;
    cin >> T;
    while (T--) {
        string S;
        cin >> S;
        vector<pair<bool, string>> vec(0);
        ll prev_cur = 0;
        bool plus = true;
        for (ll i = 0; i < S.size(); i++) {
            if (S[i] == '+' || S[i] == '-') {
                if (prev_cur != i) {
                    vec.push_back(
                        make_pair(plus, S.substr(prev_cur, i - prev_cur)));
                }
                if (S[i] == '-') {
                    plus = false;
                } else {
                    plus = true;
                }
                prev_cur = i + 1;
            }
        }
        vec.push_back(
            make_pair(plus, S.substr(prev_cur, S.size() + 1 - prev_cur)));
        string ans = "";
        for (ll i = 0; i < vec.size(); i++) {
            if (!(i == 0 && vec[i].first)) {
                if (vec[i].first) {
                    ans += '+';
                } else {
                    ans += '-';
                }
            }
            ll cnt_q = 0;
            ll len = vec[i].second.size();
            for (ll j = 0; j < len; j++) {
                if ((vec[i].second)[j] == '?') {
                    cnt_q++;
                }
            }
            if (vec[i].first) {
                for (ll j = 0; j < len; j++) {
                    if ((vec[i].second)[j] == '?') {
                        (vec[i].second)[j] = '9';
                    }
                }
            } else {
                if (cnt_q == 2 && (vec[i].second)[0] == '?' &&
                    (vec[i].second)[len - 1] == '?') {
                    (vec[i].second)[0] = '1';
                    (vec[i].second)[len - 1] = '1';
                } else if (cnt_q == 1 && (vec[i].second)[len - 1] == '?') {
                    (vec[i].second)[len - 1] = '1';
                } else {
                    bool ap = false;
                    for (ll j = 0; j < len; j++) {
                        if ((vec[i].second)[j] == '?') {
                            if (j == 0) {
                                (vec[i].second)[j] = '1';
                            } else if (ap) {
                                (vec[i].second)[j] = '9';
                            } else {
                                (vec[i].second)[j] = '+';
                                ap = true;
                            }
                        }
                    }
                }
            }
            ans += vec[i].second;
        }
        /*for (ll i = 0; i < vec.size(); i++) {
            cout << vec[i].first << " " << vec[i].second << endl;
        }*/
        cout << ans << endl;
    }
}