#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long int arr[100001];
long long int summer(int n, int k) {
  long long int maxsum = 0;
  long long int b[n + 1];
  for (int i = 1; i <= n; ++i) {
    b[i] = arr[i] + 1ll * k * i;
  }
  sort(b + 1, b + n + 1);
  for (int i = 1; i <= k; ++i) maxsum += b[i];
  return maxsum;
}
int main() {
  int test = 1;
  while (test--) {
    string s, t;
    cin >> s >> t;
    int quests = 0;
    for (int i = 0; i < s.size(); ++i) {
      if (s[i] == '?') quests++;
    }
    if (quests == 0) {
      cout << s;
      exit(0);
    }
    int sarr[26], tarr[26];
    memset(sarr, 0, sizeof(sarr));
    memset(tarr, 0, sizeof(tarr));
    for (int i = 0; i < s.size(); ++i) {
      if (s[i] != '?') sarr[s[i] - 'a']++;
    }
    for (int i = 0; i < t.size(); ++i) {
      tarr[t[i] - 'a']++;
    }
    int rem = 0;
    for (int i = 0; i < 26; ++i) {
      if (t[i] > s[i]) rem += tarr[i] - sarr[i];
    }
    if (rem > quests) {
      for (int i = 0; i < s.size(); ++i) {
        if (s[i] != '?')
          cout << s[i];
        else
          cout << 'a';
      }
      exit(0);
    }
    int left = 1, right = (s.size() / t.size()) + 1;
    while (left < right - 1) {
      int mid = (left + right) / 2;
      int counter = 0;
      for (int i = 0; i < 26; ++i) {
        if (tarr[i] * mid > sarr[i]) counter += (tarr[i] * mid - sarr[i]);
      }
      if (counter > quests)
        right = mid;
      else
        left = mid;
    }
    int counter = 0, ans;
    for (int i = 0; i < 26; ++i) {
      if (tarr[i] * right > sarr[i]) counter += (tarr[i] * right - sarr[i]);
    }
    if (counter <= quests)
      ans = right;
    else
      ans = left;
    int arr[26];
    memset(arr, 0, sizeof(arr));
    for (int i = 0; i < 26; ++i) {
      if (ans * tarr[i] > sarr[i]) {
        arr[i] = ans * tarr[i] - sarr[i];
      }
    }
    int j = 0;
    for (int i = 0; i < s.size(); ++i) {
      if (s[i] != '?')
        cout << s[i];
      else {
        if (j == 26) {
          cout << 'a';
          continue;
        } else {
          if (arr[j] == 0) {
            while (j < 26 && arr[j] == 0) {
              j++;
            }
            if (j == 26) {
              cout << 'a';
              continue;
            }
            cout << char(j + 97);
            arr[j]--;
          } else {
            cout << char(j + 97);
            arr[j]--;
          }
        }
      }
    }
  }
  return 0;
}
