#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 10;
int n, m;
char s[MAXN], t[MAXN];
int tongs[150], tongt[150];
int cntp;
inline bool chk(int mid) {
  long long sum = 0;
  for (int i = 'a'; i <= 'z'; i++)
    sum += max(0ll, (long long)tongt[i] * mid - tongs[i]);
  return sum <= cntp;
}
int main() {
  scanf("%s\n%s", s + 1, t + 1);
  n = strlen(s + 1);
  m = strlen(t + 1);
  for (int i = 1; i <= n; i++)
    if (s[i] != '?')
      tongs[(int)s[i]]++;
    else
      cntp++;
  for (int i = 1; i <= m; i++) tongt[(int)t[i]]++;
  int l = 0, r = 1e6;
  int tot = 0;
  while (l <= r) {
    int mid = (l + r) >> 1;
    if (chk(mid))
      tot = mid, l = mid + 1;
    else
      r = mid - 1;
  }
  vector<char> ans;
  for (int i = 'a'; i <= 'z'; i++)
    for (int j = 1; j <= tongt[i] * tot - tongs[i]; j++) ans.push_back(i);
  int pos = 0;
  for (int i = 1; i <= n; i++) {
    if (s[i] == '?') {
      if (pos < (int)ans.size())
        printf("%c", ans[pos++]);
      else
        printf("a");
    } else
      printf("%c", s[i]);
  }
  return 0;
}
