/** author: shobonvip created: 2025.02.14 21:50:15 **/ #include<bits/stdc++.h> using namespace std; //* ATCODER #include<atcoder/all> using namespace atcoder; typedef modint998244353 mint; //*/ /* BOOST MULTIPRECISION #include<boost/multiprecision/cpp_int.hpp> using namespace boost::multiprecision; //*/ typedef long long ll; #define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++) #define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--) #define all(v) v.begin(), v.end() template <typename T> bool chmin(T &a, const T &b) { if (a <= b) return false; a = b; return true; } template <typename T> bool chmax(T &a, const T &b) { if (a >= b) return false; a = b; return true; } template <typename T> T max(vector<T> &a){ assert(!a.empty()); T ret = a[0]; for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]); return ret; } template <typename T> T min(vector<T> &a){ assert(!a.empty()); T ret = a[0]; for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]); return ret; } template <typename T> T sum(vector<T> &a){ T ret = 0; for (int i=0; i<(int)a.size(); i++) ret += a[i]; return ret; } void solve(){ string s; cin >> s; vector<pair<int,int>> minus; vector<pair<int,int>> plus; int mode = 0; int st = 0; rep(i,0,(int)s.size()){ if (s[i]=='-') { if (mode == 1) { minus.push_back(pair(st, i)); }else{ plus.push_back(pair(st, i)); } mode = 1; st=i+1; }else if(s[i]=='+'){ if (mode == 1) { minus.push_back(pair(st, i)); }else{ plus.push_back(pair(st, i)); } mode = 0; st=i+1; }else{ //pass } } if (mode == 1) { minus.push_back(pair(st, (int)s.size())); }else{ plus.push_back(pair(st, (int)s.size())); } for (auto [l,r]: plus) { rep(i,l,r) { if (s[i]=='?') s[i]='9'; } } for (auto [l,r]: minus) { if (r-l <= 2) { rep(i,l,r){ if(s[i]=='?') s[i]='1'; } }else{ if (s[l]=='?') s[l]='1'; bool mode=0; rep(i,l+1,r-1){ if(s[i]=='?' && !mode){ s[i]='+'; mode=1; continue; } if (s[i]=='?'){ if(!mode) s[i]='1'; else s[i]='9'; } } if (s[r-1]=='?'){ if(!mode)s[r-1]='1'; else s[r-1]='9'; } } } cout << s << '\n'; } int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while(t--) solve(); }