Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

D. Suitable Replacement

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputYou 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.

Input

The first line contains string *s* (1 ≤ |*s*| ≤ 10^{6}).

The second line contains string *t* (1 ≤ |*t*| ≤ 10^{6}).

Output

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.

Examples

Input

?aa?

ab

Output

baab

Input

??b?

za

Output

azbz

Input

abcd

abacaba

Output

abcd

Note

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.

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/22/2019 20:23:25 (d3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|