#include <bits/stdc++.h>
using namespace std;
const double PI = atan(1) * 4;
const int mod = 1e9 + 7;
int dx[] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
int dy[] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
int n, k;
long long a[100009], b[100009], sum;
bool check(double mid) {
  double sum = mid + k;
  for (int i = 0; i < n - 1; i++) {
    sum -= sum / (a[i]);
    sum -= sum / (b[i + 1]);
  }
  sum -= sum / (a[n - 1]);
  sum -= sum / (b[0]);
  if (sum >= k)
    return true;
  else
    return false;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int tt = 1;
  while (tt--) {
    string s, t;
    cin >> s >> t;
    map<char, int> m1;
    multiset<char> m2;
    for (char c : s) {
      m1[c]++;
    }
    for (char c : t) {
      m2.insert(c);
    }
    string ans = "";
    auto itr = m2.begin();
    while (m1['?'] > 0) {
      if (itr == m2.end()) {
        itr = m2.begin();
      }
      if (m1[*itr] > 0) {
        m1[*itr]--;
      } else {
        ans += (*itr);
        m1['?']--;
      }
      itr++;
    }
    for (char &c : s) {
      if (c == '?') {
        c = ans[ans.size() - 1];
        ans.pop_back();
      }
    }
    cout << s;
  }
  cerr << "Time elapsed : " << 1.0 * clock() / CLOCKS_PER_SEC << " sec \n";
  return 0;
}
