#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 100;
char str[maxn];
char abc[maxn];
int bq[30];
struct node {
  int snum, tnum;
  char s;
} data[30];
bool check(long long mid, long long op) {
  long long temp = 0;
  for (int i = 0; i < 26; i++) {
    if (data[i].tnum != 0) {
      long long thi = (long long)mid * data[i].tnum - data[i].snum;
      if (thi <= 0) continue;
      temp += thi;
    }
  }
  return temp <= op;
}
int main() {
  cin >> str >> abc;
  int slen = strlen(str), alen = strlen(abc);
  int op = 0;
  for (int i = 0; i < 26; i++) data[i].s = i + 'a';
  for (int i = 0; i < slen; i++) {
    if (str[i] == '?')
      op++;
    else
      data[str[i] - 'a'].snum++;
  }
  for (int i = 0; i < alen; i++) data[abc[i] - 'a'].tnum++;
  long long l = 0, r = 5e6, ans = 0;
  while (l <= r) {
    long long mid = l + (r - l) / 2;
    if (check(mid, op)) {
      l = mid + 1;
      ans = mid;
    } else
      r = mid - 1;
  }
  for (int i = 0; i < 26; i++) {
    if (data[i].tnum != 0) {
      int thi = ans * data[i].tnum - data[i].snum;
      if (thi <= 0) continue;
      bq[i] += thi;
    } else
      continue;
  }
  for (int i = 0; i < slen; i++) {
    if (str[i] == '?') {
      for (int j = 0; j < 26; j++)
        if (bq[j]) {
          str[i] = j + 'a';
          bq[j]--;
          break;
        }
    }
  }
  for (int i = 0; i < slen; i++)
    if (str[i] == '?') str[i] = abc[0];
  cout << str << endl;
  return 0;
}
