//#include "grader.cpp"
#include <cstdlib>
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(1e9+7)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
std::string solve_puzzle(std::string s, std::vector<int> c){
int n = sz(s);
int k = sz(c);
vector<vector<bool>>pref(n,vector<bool>(k+2)),suff(n,vector<bool>(k+2));
int b=0;
vector<int>pw(n);
for(int i=0;i<n;i++){
pw[i]+=s[i]=='_';
if(i)pw[i]+=pw[i-1];
}
for(int i=0;i<n;i++){
if(s[i] == 'X')b++;
if(!b)pref[i][0] = 1;
for(int j=1;j<=k;j++){
bool o = i && pref[i-1][j];
bool e = i>=c[j-1] && s[i-c[j-1]] != 'X' && i>c[j-1]+1 && pref[i-c[j-1]-1][j-1];
if(j == 1 && i == c[j-1]-1)e = 1;
if(s[i] == '_')pref[i][j] = o;
else if(s[i] == 'X')pref[i][j] = e;
else pref[i][j] = o || e;
}
}
b=0;
for(int i=n-1;i>=0;i--){
if(s[i] == 'X')b++;
if(!b)suff[i][0] = 1;
for(int j=1;j<=k;j++){
bool o = i!=n-1 && suff[i+1][j];
bool e = i+c[k-j]<n && s[i+c[k-j]] != 'X' && i+c[k-j]+1<n && suff[i+c[k-j]+1][j-1];
if(j == 1 && i == n-c[k-j])e = 1;
if(s[i] == '_')suff[i][j] = o;
else if(s[i] == 'X')suff[i][j] = e;
else suff[i][j] = o || e;
}
}
/*
for(int i=0;i<=k;i++){
for(int j=0;j<n;j++){
cout<<pref[j][i]<<" ";
}
cout<<'\n';
}
cout<<'\n';
for(int i=0;i<=k;i++){
for(int j=0;j<n;j++){
cout<<suff[j][i]<<" ";
}
cout<<'\n';
}*/
vector<bool>w(n,0);
vector<ll>bl(n+1,0);
for(int i=0;i<n;i++){
if(s[i]!='X')
for(int j=0;j<=k;j++){
bool o=0,e=0;
if(i == 0){if(j==0)o = 1;}
else if(pref[i-1][j])o = 1;
if(i==n-1){if(j==k)e = 1;}
else if(suff[i+1][k-j])e = 1;
w[i] = w[i]|(o&&e);
}
if(s[i]!='_')
for(int j=1;j<=k;j++){
bool ok = 1;
if(i && (s[i-1] == 'X' || !pref[i-1][j-1]))ok = 0;
if(i>1 && !pref[i-2][j-1])ok = 0;
if(i+c[k-j] <n && (s[i+c[k-j]] == 'X' || !suff[i+c[k-j]][k-j]))ok = 0;
if(i+c[k-j]+1<n && !suff[i+c[k-j]+1][k-j])ok = 0;
if(i+c[k-j]-1>=n)ok = 0;
if(ok){
int cc = pw[i+c[k-j]-1];
if(i)cc-=pw[i-1];
if(cc>0)continue;
bl[i]++;
bl[i+c[k-j]]--;
}
}
}
//for(int i=0;i<n;i++)cout<<pw[i]<<" ";
for(int i=1;i<n;i++)bl[i]+=bl[i-1];
string ans(n,'a');
for(int i=0;i<n;i++){
ans[i] = s[i];
if(s[i] != '.')continue;
if(w[i] && bl[i])ans[i] = '?';
else if(w[i])ans[i] = '_';
else ans[i] = 'X';
}
return ans;
}
