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.*;

public class MyClass
{
    static class node
    {
        boolean can = false;
        int[] count = new int[26];
        
    }
 
    static PrintWriter pw = new PrintWriter(System.out);
    static String s , t;
    static int[] countS = new int[26];
    static int[] countT = new int[26];
    
    static int[] complete  = new int[26];
    static int[] remain = new int[26];

    static int sizeS , sizeT;
    
    static int empty = 0;


    static node can(int numOcurences , int emptyCount)
    {
        node res = new node();
        
        for(int i = 0 ; i<26 ; i++)
        {
            int have = countS[i];
            int need = countT[i] * numOcurences;
            
            if(need == 0)continue;
            
            if(have < need)
            {
                int x = need - have;
                
                if(emptyCount < x)
                {
                    //pw.println("i " + i + " empty " + empty + " have " + have + " need " + need);
                    return res;
                }
                else
                {
                    emptyCount -= x;
                    res.count[i] = x;
                }
            }
            
        }
            
        res.can = true;
        return res;
    }
    
    static node bs()
    {
        int L = 0 , R = sizeS / sizeT;
        node res = null;
        
        while(L<=R)
        {
            int mid = (L+R)/2;
            node nn = can(mid , empty);
            
            if(nn.can)
            {
                L = mid + 1;
                res = nn;
            }
            else
            {
                R = mid - 1;
            }
        }
        
        return res;
    }
   
    public static void main(String[] args)throws Exception
    {
        Reader.init(System.in);
        s = Reader.next();
        t = Reader.next();
        
        sizeS = s.length();
        sizeT = t.length();
        
        char[] res = new char[sizeS];
        ArrayList<Integer> ind = new ArrayList();
        
        for(int i = 0 ; i<sizeS ; i++)
        {
            char c = s.charAt(i);
            
            if(c == '?')
            {
                empty++;
                ind.add(i);
            }
            else 
            {
                countS[c-'a']++;
                res[i] = c;
            }
        }
        
        for(int i = 0 ; i<sizeT ; i++)
        {
            char c = t.charAt(i);
            countT[c-'a']++;
        }
        
        node nBs = bs();
  
        Iterator<Integer> itr = ind.iterator();
        
        for(int i  = 0 ; i<26 ; i++)
        {
            for(int j = 0 ; j<nBs.count[i] ; j++)
            {
                res[itr.next()] = (char)(i + 'a');
            }
        }

        while(itr.hasNext())
        {
            res[itr.next()] = 'a';
            empty--;
        }
        
        pw.println(res);
        pw.close();
    }

}







class Reader {

    static BufferedReader reader;
    static StringTokenizer tokenizer;

    public static int pars(String x) {
        int num = 0;
        int i = 0;
        if (x.charAt(0) == '-') {
            i = 1;
        }
        for (; i < x.length(); i++) {
            num = num * 10 + (x.charAt(i) - '0');
        }

        if (x.charAt(0) == '-') {
            return -num;
        }

        return num;
    }

    static void init(InputStream input) {
        reader = new BufferedReader(
                new InputStreamReader(input));
        tokenizer = new StringTokenizer("");
    }

    static void init(FileReader input) {
        reader = new BufferedReader(input);
        tokenizer = new StringTokenizer("");
    }

    static String next() throws IOException {
        while (!tokenizer.hasMoreTokens())
        {
            String line = reader.readLine();
            if(line == null || line.equals(""))throw  new IOException();
            tokenizer = new StringTokenizer(line);
        }
        return tokenizer.nextToken();
    }

    static int nextInt() throws IOException {
        return pars(next());
    }

    static long nextLong() throws IOException {
        return Long.parseLong(next());
    }

    static double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }


}