#include<iostream>
#include<string>
using namespace std;
typedef long long int ll;
int main(){
int t;
cin>>t;
string s;
while(t--){
cin>>s;
ll l = s.length();
char r[l+1];
if(s[0] == '?'){
r[0] = '0';
}
else{
r[0] = s[0];
}
for(ll i=1; i<l; i++ ){
if (s[i] == '?'){
r[i] = r[i-1];
}
else{
r[i] = s[i];
}
}
r[l] = '\0';
cout<<r<<"\n";
}
}
1706A - Another String Minimization Problem | 1695B - Circle Game |
1702B - Polycarp Writes a String from Memory | 1701A - Grass Field |
489C - Given Length and Sum of Digits | 886B - Vlad and Cafes |
915A - Garden | 356A - Knight Tournament |
1330A - Dreamoon and Ranking Collection | 1692B - All Distinct |
1156C - Match Points | 1675A - Food for Animals |
1328C - Ternary XOR | 1689A - Lex String |
1708B - Difference of GCDs | 863A - Quasi-palindrome |
1478A - Nezzar and Colorful Balls | 1581B - Diameter of Graph |
404A - Valera and X | 908A - New Year and Counting Cards |
146A - Lucky Ticket | 1594C - Make Them Equal |
1676A - Lucky | 1700B - Palindromic Numbers |
702C - Cellular Network | 1672C - Unequal Array |
1706C - Qpwoeirut And The City | 1697A - Parkway Walk |
1505B - DMCA | 478B - Random Teams |