#include <bits/stdc++.h>
using namespace std;
int a[30];
int b[30];
string s1, s2;
int len1;
int len2;
int cnt;
int Cnt;
bool check(int x) {
  int re = 0;
  memset(b, 0, sizeof(b));
  for (int i = 0; i < len2; i++) {
    b[s2[i] - 'a' + 1]++;
  }
  for (int i = 1; i <= 26; i++) {
    if (!b[i]) {
      continue;
    }
    if (b[i] * x > a[i]) {
      re += b[i] * x - a[i];
    }
  }
  if (re > Cnt) {
    return false;
  }
  return true;
}
int ans;
int v[1000005];
int pl;
int main() {
  cin >> s1 >> s2;
  len1 = s1.size();
  len2 = s2.size();
  for (int i = 0; i < len1; i++) {
    if (s1[i] == '?') {
      pl++;
      v[pl] = i;
      continue;
    }
    int t = s1[i] - 'a' + 1;
    a[t]++;
  }
  for (int i = 1; i <= 26; i++) {
    cnt += a[i];
  }
  Cnt = len1 - cnt;
  int left = 0;
  int right = len1 / len2;
  while (left <= right) {
    int mid = (left + right) / 2;
    if (check(mid)) {
      ans = max(ans, mid);
      left = mid + 1;
    } else {
      right = mid - 1;
    }
  }
  pl = 0;
  for (int i = 1; i <= 26; i++) {
    if (!b[i]) {
      continue;
    }
    for (int j = a[i] + 1; j <= ans * b[i]; j++) {
      pl++;
      s1[v[pl]] = 'a' + i - 1;
    }
  }
  for (int i = 0; i < len1; i++) {
    if (s1[i] == '?') {
      cout << 'a';
    } else {
      cout << s1[i];
    }
  }
  return 0;
}
