CF825D.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.

给你两个由小写拉丁字母组成的字符串 $s$ 和 $t$，其中字符串 $s$ 还可能包含字符 ?。

字符串 $s$ 的适配度（suitability） 按如下方式计算：

你可以任意次地交换 $s$ 中任意两个位置上的字符（即对 $s$ 进行任意次数的字符位置交换操作）。在所有由此得到的字符串中，你选择使得字符串 $t$ 的互不相交出现次数最大的那个。该最大出现次数即为 $s$ 的适配度。

你需要将 $s$ 中所有 ? 字符替换为小写拉丁字母，使得 $s$ 的适配度最大化。

The first line contains string s (1 ≤ |s| ≤ 106).

The second line contains string t (1 ≤ |t| ≤ 106).

第一行包含字符串 $s$（$1 \leq |s| \leq 10^6$）。

第二行包含字符串 $t$（$1 \leq |t| \leq 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.

将字符串 $s$ 中的字符 ? 替换为小写拉丁字母，使得该字符串的“适宜度”（suitability）最大化。

如果存在多个具有最大适宜度的字符串，则输出其中任意一个即可。

In the first example string "baab" can be transformed to "abab" with swaps, this one has suitability of 2. That means that string "baab" also has suitability of 2.

In the second example maximal suitability you can achieve is 1 and there are several dozens of such strings, "azbz" is just one of them.

In the third example there are no '?' characters and the suitability of the string is 0.

在第一个例子中，字符串 “baab” 可通过交换操作变为 “abab”，而该字符串的适配度为 2。这意味着字符串 “baab” 的适配度也为 2。

在第二个例子中，所能达到的最大适配度为 1，且满足该适配度的字符串有数十个，“azbz” 只是其中之一。

在第三个例子中，字符串中不含任何 “?” 字符，其适配度为 0。