#include <bits/stdc++.h>
using namespace std;
mt19937_64 rang(
    chrono::high_resolution_clock::now().time_since_epoch().count());
int rng(int lim) {
  uniform_int_distribution<int> uid(0, lim - 1);
  return uid(rang);
}
long long INF = LLONG_MAX;
const long long M = 1000000007;
long long powm(long long, long long);
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  string s, t;
  cin >> s >> t;
  long long n = s.length();
  map<char, long long> mp, mpt;
  for (int i = 0; i < n; i++) mp[s[i]]++;
  for (int i = 0; i < t.length(); i++) mpt[t[i]]++;
  long long lo = 0, hi = n;
  while (lo < hi) {
    long long mid = (lo + hi) >> 1;
    if (mid == lo) mid = lo + 1;
    bool flag = 1;
    long long slashes = 0;
    for (auto x : mpt) {
      char c = x.first;
      long long y = x.second;
      long long req = y * mid;
      req -= mp[c];
      req = max((long long)0, req);
      slashes += req;
    }
    if (slashes > mp['?']) flag = 0;
    if (flag)
      lo = mid;
    else
      hi = mid - 1;
  }
  vector<char> ans;
  queue<char> q;
  for (auto x : mpt) {
    long long y = x.second;
    long long req = y * lo;
    req -= mp[x.first];
    for (int i = 0; i < req; i++) q.push(x.first);
  }
  ans.assign(s.length(), 'a');
  for (int i = 0; i < n; i++)
    if (s[i] != '?') ans[i] = s[i];
  for (int i = 0; i < n; i++) {
    if (q.empty()) continue;
    if (s[i] == '?') {
      ans[i] = q.front();
      q.pop();
    }
  }
  for (int i = 0; i < n; i++) cout << ans[i];
}
long long powm(long long a, long long b) {
  long long res = 1;
  while (b) {
    if (b & 1) res = (res * a) % M;
    a = (a * a) % M;
    b >>= 1;
  }
  return res;
}
