Problem: 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.

Input

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

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

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.

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;


import static java.lang.Math.*;
import static java.util.Collections.*;
import static java.util.Arrays.*;




public class ProblemD {

    static class Problem {
        
        InputReader reader;
        PrintWriter writer;
        
        Problem() {
            reader = new InputReader(System.in);
            writer = new PrintWriter(System.out);
        }

        Problem(File inputFile, File outputFile) throws IOException {
            writer = new PrintWriter(outputFile);
        }

        void runSolution() {
            solution();
            writer.close();
        }

        void solution() {
            StringBuffer s = new StringBuffer(reader.next());
            String t = reader.next();
            
            int[] cntChar = new int[26];
            for (int i = 0; i < s.length(); i++) {
                if (s.charAt(i) != '?') {
                    cntChar[s.charAt(i) - 'a']++;
                }
            }

            int charToAdd = 0;
            for (int i = 0; i < s.length(); i++) {
                if (s.charAt(i) == '?') {
                    while (cntChar[t.charAt(charToAdd) - 'a'] > 0) {
                        cntChar[t.charAt(charToAdd) - 'a']--;
                        charToAdd = (charToAdd + 1) % t.length();
                    }
                    s.setCharAt(i, t.charAt(charToAdd));
                    charToAdd = (charToAdd + 1) % t.length();
                }
            }

            writer.println(s);
        }

    }

    static class InputReader {

        public BufferedReader bufferedReader;
        public StringTokenizer stringTokenizer;

        public InputReader(InputStream inputStream) {
            bufferedReader = new BufferedReader(new InputStreamReader(inputStream), 32768);
            stringTokenizer = null;
        }

        public String next() {
            while (stringTokenizer == null || !stringTokenizer.hasMoreTokens()) {
                try {
                    stringTokenizer = new StringTokenizer(bufferedReader.readLine());
                } catch (IOException exception) {
                    throw new RuntimeException(exception);
                }
            }
            return stringTokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }

    public static void main(String args[]) throws IOException {
        Problem problemD = new Problem();
        //Problem problemD = new Problem(new File("input.txt"), new File("output.txt"));
        problemD.runSolution();
    }

}