#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "paint.h"
bool solve(string s, VI c) {
s = "_" + s;
int n = s.size();
int k = c.size();
VI pref = VI(n+1);
rep(i, n) pref[i+1] += pref[i] + (s[i] == '_');
VVI dp(n+1, VI(k+1));
dp[0][0] = true;
replr(i, 1, n) {
if (s[i-1] == 'X') break;
dp[i][0] = true;
}
replr(i, 1, n) replr(j, 1, k) {
if (s[i-1] != 'X') dp[i][j] |= dp[i-1][j];
int sz = c[j-1];
if (i-sz <= 0 || (pref[i] - pref[i-sz])) continue;
if (s[i-sz-1] != 'X') dp[i][j] |= dp[i-sz-1][j-1];
}
return dp[n][k];
}
string solve_puzzle(string s, VI c) {
int n = s.size();
int k = c.size();
string ans(n, '?');
rep(i, n) {
if (s[i] != '.') ans[i] = s[i];
else {
s[i] = 'X';
bool a = solve(s, c);
s[i] = '_';
bool b = solve(s, c);
s[i] = '.';
if (a && !b) ans[i] = 'X';
else if (!a && b) ans[i] = '_';
}
}
return ans;
}
