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.io.FileInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.Scanner;

public class D {

  private static final String REGEX = " ";
  private static final Boolean DEBUG = false;
  private static final String FILE_NAME = "input.txt";


  public static void main(String[] args) throws IOException {
    if (DEBUG) {
      generate();
    }
    Solver solver = new Solver();
    solver.readData();
    solver.solveAndPrint();
  }

  private static void generate() throws IOException {
//    FileWriter writer = new FileWriter("input.txt");
//    writer.close();
  }

  private static class Solver {
    String s, t;
    private int[] tCount;
    private int[] sCount;

    void readData() throws IOException {
      InputStream in = DEBUG ? new FileInputStream(FILE_NAME) : System.in;
      Scanner scanner = new Scanner(in);
      s = scanner.nextLine();
      t = scanner.nextLine();
      scanner.close();
    }

    void solveAndPrint() {
      tCount = new int[26];
      for (int i = 0; i < t.length(); i++) {
        char c = t.charAt(i);
        tCount[c - 'a']++;
      }
      sCount = new int[26];

      for (int i = 0; i < s.length(); i++) {
        char c = s.charAt(i);
        if (c == '?') {
          continue;
        }
        sCount[c - 'a']++;
      }

      update();

      char minIndex;
      StringBuilder builder = new StringBuilder();
      for (int i = 0; i < s.length(); i++) {
        minIndex = minIndex(sCount);
        char c = s.charAt(i);
        if (c != '?') {
          builder.append(c);
        } else {
          char letter = (char) ('a' + minIndex);
          builder.append(letter);
          sCount[minIndex]++;
          if (sCount[minIndex] >= 0) {
            update();
          }
        }
      }
      System.out.println(builder);
    }

    private void update() {
      boolean negative = false;
      for (int i = 0; i < 26; i++) {
        if (sCount[i] <0) {
          negative = true;
        }
      }
      while (!negative) {
        for (int i = 0; i < 26; i++) {
          sCount[i] -= tCount[i];
          if (sCount[i] < 0) {
            negative = true;
          }
        }
      }
    }

  }

  public static char minIndex(int[] arr) {
    char minIndex = 0;
    for (char i = 1; i < arr.length; i++) {
      int cur = arr[i];
      if (cur < arr[minIndex]) {
        minIndex = i;
      }
    }
    return minIndex;
  }


  @SuppressWarnings("SameParameterValue")
  int[] splitInteger(String string, int n) {
    final String[] split = string.split(REGEX, n);
    int[] result = new int[split.length];
    for (int i = 0; i < n; ++i) {
      result[i] = Integer.parseInt(split[i]);
    }
    return result;
  }

  public int[] splitInteger(String string) {
    return splitInteger(string, 0);
  }


  @SuppressWarnings("SameParameterValue")
  long[] splitLong(String string, int n) {
    final String[] split = string.split(REGEX, n);
    long[] result = new long[split.length];
    for (int i = 0; i < n; ++i) {
      result[i] = Long.parseLong(split[i]);
    }
    return result;
  }

  public long[] splitLong(String string) {
    return splitLong(string, 0);
  }

  @SuppressWarnings("SameParameterValue")
  double[] splitDouble(String string, int n) {
    final String[] split = string.split(REGEX, n);
    double[] result = new double[split.length];
    for (int i = 0; i < n; ++i) {
      result[i] = Double.parseDouble(split[i]);
    }
    return result;
  }

  public double[] splitDouble(String string) {
    return splitDouble(string, 0);
  }

  @SuppressWarnings("SameParameterValue")
  String[] splitString(String string, int n) {
    return string.split(REGEX, n);
  }

  public String[] splitString(String string) {
    return splitString(string, 0);
  }

  public int max(int a, int b) {
    return Math.max(a, b);
  }

  public long max(long a, long b) {
    return Math.max(a, b);
  }

  public int min(int a, int b) {
    return Math.min(a, b);
  }

  public long min(long a, long b) {
    return Math.min(a, b);
  }

  public double max(double a, double b) {
    return Math.max(a, b);
  }

  public double min(double a, double b) {
    return Math.min(a, b);
  }

  private final static int MOD = 1000000009;

  int multMod(int a, int b) {
    return ((a % MOD) * (b % MOD)) % MOD;
  }

  int sumMod(int a, int b) {
    return ((a % MOD) + (b % MOD)) % MOD;
  }

  long multMod(long a, long b) {
    return ((a % MOD) * (b % MOD)) % MOD;
  }

  long sumMod(long a, long b) {
    return ((a % MOD) + (b % MOD)) % MOD;
  }
}


