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

public class AB
{
    static class Scan
    {
        final private int BUF_SIZE = 1 << 16;
        private int cur_size = 0;
        private int pointer = 0;
        private java.io.DataInputStream in;
        private byte buffer[] = new byte[BUF_SIZE];

        Scan(java.io.InputStream input)
        {
            in = new java.io.DataInputStream(input);
        }

        // fills the buffer with characters
        private void fill() throws java.io.IOException
        {
            cur_size = in.read(buffer, 0, BUF_SIZE);
            if (cur_size == -1) buffer[0] = 0;
            pointer = 0;
        }

        private byte read() throws java.io.IOException
        {
            if (pointer == cur_size) fill();
            return buffer[pointer++];
        }

        int readInt() throws java.io.IOException
        {
            int res = 0;
            byte c;
            while ((c = read()) <= ' ');
            boolean negate = c == '-';
            if (negate) c = read();
            while (c >= '0' && c <= '9')
            {
                res = res * 10 + c - '0';
                c = read();
            }
            return negate ? -res : res;
        }

        long readLong() throws java.io.IOException
        {
            long res = 0;
            byte c;
            while ((c = read()) <= ' ') ;
            boolean negate = c == '-';
            if (negate) c = read();
            while (c >= '0' && c <= '9') {
                res = res * 10 + c - '0';
                c = read();
            }
            return negate ? -res : res;
        }

        double readDouble() throws java.io.IOException
        {
            byte c;
            while ((c = read()) <= ' ');
            boolean negate = c == '-';
            if (negate)
                c = read();
            int power = 0;
            long res = 0;
            boolean dot_flag = false;
            for (;(c >= '0' && c <= '9') || c == '.'; c = read())
            {
                if (dot_flag)
                    power++;
                if (c == '.')
                    dot_flag = true;
                else
                    res = res * 10 + c - '0';
            }
            double ret = res / Math.pow(10, power);
            return negate ? -ret : ret;
        }

        // skip defines whether ' ', '\n', '\r' must be skipped in readChar method
        char readChar(boolean skip) throws java.io.IOException
        {
            if (skip)
            {
                byte c;
                while ((c = read()) == ' ' || c == '\n' || c == '\r');
                return (char) c;
            }
            return (char) read();
        }

        // skip defines whether current string must be skipped in readString and readText methods

        /* If exact length is known, in terms of efficiency
         it is better to specify it while using readText, readString and readWord methods */

        String readWord() throws java.io.IOException
        {
            byte c;
            while ((c = read()) == '\n' || c == ' ' || c == '\r');
            StringBuilder s = new StringBuilder();
            s.append((char)c);
            for (;(c = read()) != '\n' && c != ' ' && c != '\r' && c != 0; s.append((char)c));
            return s.toString();
        }

        String readWord(int LEN) throws java.io.IOException
        {
            byte[] s = new byte[LEN];
            byte c;
            while ((c = read()) == '\n' || c == ' ' || c == '\r');
            s[0] = c;
            for (int i = 1; (c = read()) != ' ' && c != '\n' && c != '\r' && c != 0; s[i++] = c);
            return new String(s);
        }

        String readString(boolean skip, int LEN) throws java.io.IOException
        {
            byte[] s = new byte[LEN];
            byte c;
            if (skip)
                while ((c = read()) != '\n');
            for (int i = 0; (c = read()) != '\n' && c != '\r' && c != 0; s[i++] = c);
            read();
            return new String(s);
        }

        String readString(boolean skip) throws java.io.IOException
        {
            StringBuilder s = new StringBuilder("");
            byte c;
            if (skip)
                while ((c = read()) != '\n');
            for (;(c = read()) != '\n' && c != '\r' && c != 0; s.append((char)c));
            read();
            return s.toString();
        }

        String readText(boolean skip, int LEN) throws java.io.IOException
        {
            byte[] s = new byte[LEN];
            byte c;
            if (skip)
                while ((c = read()) != '\n');
            for (int i = 0; (c = read()) != 0; s[i++] = c);
            return new String(s);
        }

        String readText(boolean skip) throws java.io.IOException
        {
            StringBuilder s = new StringBuilder("");
            byte c;
            if (skip)
                while ((c = read()) != '\n');
            for (;(c = read()) != 0; s.append((char)c));
            return s.toString();
        }
    }

    static class Pair<T1 extends Comparable<T1>, T2 extends Comparable<T2>> implements Comparable<Pair<T1, T2>>
    {
        T1 left;
        T2 right;

        Pair(T1 l, T2 r)
        {
            left = l;
            right = r;
        }

        public String toString()
        {
            return left + " " + right;
        }

        public int compareTo(Pair<T1, T2> e)
        {
            if (left.compareTo(e.left) > 0) return 1;
            if (left.compareTo(e.left) < 0) return -1;
            if (right.compareTo(e.right) > 0) return 1;
            if (right.compareTo(e.right) < 0) return -1;
            return 0;
        }

        public int hashCode()
        {
            return (int)((left.hashCode() * (Integer.MAX_VALUE + 1L) + right.hashCode()) % Integer.MAX_VALUE);
        }

        public boolean equals(Object o)
        {
            return (o instanceof Pair) && (((Pair) o).left == this.left) && (((Pair) o).right == this.right);
        }
    }

    static class Triplet<T1 extends Comparable<T1>, T2 extends Comparable<T2>, T3 extends Comparable<T3>>
            implements Comparable<Triplet<T1, T2, T3>>
    {
        private T1 left;
        private T2 mid;
        private T3 right;

        Triplet(T1 l, T2 m, T3 r)
        {
            left = l;
            mid = m;
            right = r;
        }

        T1 getLeft()
        {
            return left;
        }

        T2 getMid()
        {
            return mid;
        }

        T3 getRight()
        {
            return right;
        }

        public int compareTo(Triplet<T1, T2, T3> e)
        {
            if (left.compareTo(e.getLeft()) > 0) return 1;
            if (left.compareTo(e.getLeft()) < 0) return -1;
            if (mid.compareTo(e.getMid()) > 0) return 1;
            if (mid.compareTo(e.getMid()) < 0) return -1;
            if (right.compareTo(e.getRight()) > 0) return 1;
            if (right.compareTo(e.getRight()) < 0) return -1;
            return 0;
        }

        public String toString()
        {
            return left + " " + mid + " " + right;
        }
    }


    static boolean check(long x, long[]cnt_s, long[]cnt_t, long q)
    {
        for (int i = 0; i < 26; i++)
        {
            if (cnt_t[i] * x > cnt_s[i])
            {
                if (q < cnt_t[i] * x - cnt_s[i])
                    return false;
                q -= cnt_t[i] * x - cnt_s[i];
            }
        }
        return true;
    }


    public static void main(String[] args) throws Exception
    {
        Scan in = new Scan(System.in);
        String s = in.readWord(), t = in.readWord();
        long[] cnt_s = new long[26], cnt_t = new long[26];
        long q = 0;
        for (int i = 0; i < s.length(); i++)
            if (s.charAt(i) != '?')
                cnt_s[s.charAt(i) - 'a']++;
            else
                q++;
        for (int i = 0; i < t.length(); i++)
            cnt_t[t.charAt(i) - 'a']++;
        long l = 0, r = (long) 1e6 + 1;
        while (r - l > 1)
        {
            long m = (l + r) / 2;
            if (check(m, cnt_s, cnt_t, q))
                l = m;
            else
                r = m;
        }
        long[] suf = new long[26];
        for (int i = 0; i < 26; i++)
            suf[i] = cnt_t[i] * l;
        StringBuilder res = new StringBuilder(s);
        int j = 0;
        while (j < 26 && suf[j] <= cnt_s[j])
            j++;
        for (int i = 0; i < res.length(); i++)
        {
            if (res.charAt(i) == '?')
            {
                if (j == 26)
                    res.setCharAt(i, 'z');
                else if (suf[j] > cnt_s[j])
                {
                    res.setCharAt(i, (char)(j + 'a'));
                    cnt_s[j]++;
                    while (j < 26 && suf[j] <= cnt_s[j])
                        j++;
                }
            }
        }
        System.out.println(res);
    }
}