#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a,b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a,b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
/*
*/
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
#include "paint.h"
std::string solve_puzzle(std::string s, std::vector<int> a) {
int n = sz(s);
s = "$" + s;
int m = sz(a);
a.insert(a.begin(),0);
vector<int> p(n+5);
rep1(i,n) p[i] = p[i-1]+(s[i] == '_');
bool dp1[n+5][m+5][2], dp2[n+5][m+5][2];
memset(dp1,0,sizeof dp1);
memset(dp2,0,sizeof dp2);
dp1[0][0][0] = 1;
rep1(i,n){
rep(j,m+1){
if(s[i] != 'X'){
dp1[i][j][0] = dp1[i-1][j][0]|dp1[i-1][j][1];
}
if(s[i] != '_'){
if(j and i-a[j] >= 0 and p[i]-p[i-a[j]] == 0){
dp1[i][j][1] = dp1[i-a[j]][j-1][0];
}
}
}
}
dp2[n+1][m+1][0] = 1;
rev(i,n,1){
rep1(j,m+1){
if(s[i] != 'X'){
dp2[i][j][0] = dp2[i+1][j][0]|dp2[i+1][j][1];
}
if(s[i] != '_'){
if(j <= m and i+a[j] <= n+1 and p[i+a[j]-1]-p[i-1] == 0){
dp2[i][j][1] = dp2[i+a[j]][j+1][0];
}
}
}
}
string ans = "";
rep1(i,n){
if(s[i] != '.'){
ans.pb(s[i]);
conts;
}
bool white = 0, black = 0;
rep(j,m+1){
if((dp1[i-1][j][0]|dp1[i-1][j][1]) and (dp2[i+1][j+1][0]|dp2[i+1][j+1][1])){
white = 1;
}
}
rep1(j,m){
int len = a[j];
rev(l,i,i-len+1){
if(l < 0) conts;
// r-l+1 = len
// r = len+l-1
int r = len+l-1;
if(r > n) conts;
int white_cnt = p[r]-p[l-1];
if(white_cnt) conts;
if(dp1[l-1][j-1][0] and dp2[r+1][j+1][0]){
black = 1;
}
}
}
if(white+black == 2){
ans.pb('?');
}
else if(white){
ans.pb('_');
}
else if(black){
ans.pb('X');
}
else{
assert(0);
}
}
return ans;
}
