#include <bits/stdc++.h>
#pragma GCC optimize("-O2")
using namespace std;
const int N = 2e5 + 5, MOD = 1e9 + 7;
const long double EPS = 1e-9;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  string s, t;
  long long cnt = 0, i, fs[26] = {}, ft[26] = {};
  cin >> s >> t;
  for (int i = 0; i < t.size(); ++i) ft[t[i] - 'a']++;
  for (i = 0; i < s.size(); i++) {
    if (s[i] == '?')
      cnt++;
    else
      fs[s[i] - 'a']++;
  }
  if (cnt == 0) {
    cout << s;
    exit(0);
  }
  long long lo = 0, hi = (s.size() / t.size());
  long long mid, prev = -1;
  while (lo <= hi) {
    mid = lo + (hi - lo) / 2;
    long long req = 0;
    for (i = 0; i < 26; i++) {
      if (fs[i] >= (ft[i] * mid))
        continue;
      else
        req += (ft[i] * mid - fs[i]);
    }
    if (req <= cnt) {
      prev = mid;
      lo = mid + 1;
    } else
      hi = mid - 1;
  }
  if (prev == -1) {
    for (int i = 0; i < s.size(); ++i)
      if (s[i] == '?') s[i] = 'a';
    cout << s;
    exit(0);
  }
  int num[26] = {};
  for (i = 0; i < 26; i++) {
    num[i] = max(0ll, ft[i] * prev - fs[i]);
  }
  int ind = 0;
  for (i = 0; i < s.size(); i++) {
    if (s[i] == '?' and ind < 26) {
      while (num[ind] == 0 and ind < 26) ind++;
      if (ind < 26) {
        s[i] = 'a' + ind;
        num[ind]--;
      }
      if (ind == 26) s[i] = 'a';
    } else if (s[i] == '?' and ind >= 26)
      s[i] = 'a';
  }
  cout << s;
  return 0;
}
