A10987 | Suitable Replacement

You are given two strings $s$ and $t$ consisting of small Latin letters, string $s$ can also contain '?' characters.

Suitability of string $s$ is calculated by following metric:

Any two letters can be swapped positions, these operations can be performed arbitrary number of times over any pair of positions. Among all resulting strings $s$ , you choose the one with the largest number of non-intersecting occurrences of string $t$ . Suitability is this number of occurrences.

You should replace all '?' characters with small Latin letters in such a way that the suitability of string $s$ is maximal.

The first line contains string $s$ ( $1<=|s|<=10^{6}$ ).

The second line contains string $t$ ( $1<=|t|<=10^{6}$ ).

Print string $s$ with '?' replaced with small Latin letters in such a way that suitability of that string is maximal.

If there are multiple strings with maximal suitability then print any of them.