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.
import java.util.*;
import java.io.*;
import java.math.*;
public class Main
{
    static class Reader 
    { 
        private InputStream mIs;private byte[] buf = new byte[1024];private int curChar,numChars;public Reader() { this(System.in); }public Reader(InputStream is) { mIs = is;} 
        public int read() {if (numChars == -1) throw new InputMismatchException();if (curChar >= numChars) {curChar = 0;try { numChars = mIs.read(buf);} catch (IOException e) { throw new InputMismatchException();}if (numChars <= 0) return -1; }return buf[curChar++];} 
        public String nextLine(){int c = read();while (isSpaceChar(c)) c = read();StringBuilder res = new StringBuilder();do {res.appendCodePoint(c);c = read();}while (!isEndOfLine(c));return res.toString() ;} 
        public String s(){int c = read();while (isSpaceChar(c)) c = read();StringBuilder res = new StringBuilder();do {res.appendCodePoint(c);c = read();}while (!isSpaceChar(c));return res.toString();} 
        public long l(){int c = read();while (isSpaceChar(c)) c = read();int sgn = 1;if (c == '-') { sgn = -1 ; c = read() ; }long res = 0; do{ if (c < '0' || c > '9') throw new InputMismatchException();res *= 10 ; res += c - '0' ; c = read();}while(!isSpaceChar(c));return res * sgn;} 
        public int i(){int c = read() ;while (isSpaceChar(c)) c = read();int sgn = 1;if (c == '-') { sgn = -1 ; c = read() ; }int res = 0;do{if (c < '0' || c > '9') throw new InputMismatchException();res *= 10 ; res += c - '0' ; c = read() ;}while(!isSpaceChar(c));return res * sgn;} 
        public double d() throws IOException {return Double.parseDouble(s()) ;}
        public boolean isSpaceChar(int c) { return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1; } 
        public boolean isEndOfLine(int c) { return c == '\n' || c == '\r' || c == -1; } 
        public int[] arr(int n){int[] ret = new int[n];for (int i = 0; i < n; i++) {ret[i] = i();}return ret;}
    }
    
    
 
           //       |----|       /\      |    |   -----   |
           //       |   /       /  \     |    |     |     |
           //       |--/       /----\    |----|     |     |
           //       |   \     /      \   |    |     |     |
           //       |    \   /        \  |    |   -----   -------
    
    static PrintWriter out;
    public static boolean check(long need,int freq[],int freq1[],long count)
    {
        long counter=0;
        for(int i=0;i<26;i++)
            counter+=(long)Math.max(0,(long)freq[i]*need-freq1[i]);
        
        if(counter<=count)
        return true;
        return false;
    }
    public static void generate(long need,int freq[],int freq1[],String s)
    {
        int counter=0;
        long needy[]=new long[26];
        for(int i=0;i<26;i++)
            needy[i]=(long)Math.max(0,(long)freq[i]*need-freq1[i]);
        for(int i=0;i<s.length();i++)
            if(s.charAt(i)!='?')out.print(s.charAt(i));
            else
            {
                int cchar=0;
                for(int ii=0;ii<26;ii++)
                {
                    if(needy[ii]>0)
                    {
                        needy[ii]--;
                        cchar=ii;
                        break;
                    }
                }
                out.print((char)(cchar+97));
            }
    }
    
    public static void main(String[] args)throws IOException
    {
        Reader sc=new Reader();
        out=new PrintWriter(System.out);
        String s1=sc.s();
        String s2=sc.s();
        int freq[]=new int[26];
        for(int i=0;i<s2.length();i++)
        freq[s2.charAt(i)-97]++;
        int freq1[]=new int[26];
        long cunt=0;
        for(int i=0;i<s1.length();i++)
            if(s1.charAt(i)=='?')cunt++;
            else freq1[s1.charAt(i)-97]++;
        long low=0;
        long high=1000000;
        while(low<high)
        {
            long mid=(low+high+1)/2;
            if(check(mid,freq,freq1,cunt))
            low=mid;
            else
            high=mid-1;
        }
        generate(low,freq,freq1,s1);
        out.flush();
    }
}