Problem: You are given two strings s and t consisting of small Latin letters, string s can also contain '?' characters. 

Suitability of string s is calculated by following metric:

Any two letters can be swapped positions, these operations can be performed arbitrary number of times over any pair of positions. Among all resulting strings s, you choose the one with the largest number of non-intersecting occurrences of string t. Suitability is this number of occurrences.

You should replace all '?' characters with small Latin letters in such a way that the suitability of string s is maximal.

Input

The first line contains string s (1 ≤ |s| ≤ 106).

The second line contains string t (1 ≤ |t| ≤ 106).

Output

Print string s with '?' replaced with small Latin letters in such a way that suitability of that string is maximal.

If there are multiple strings with maximal suitability then print any of them.

Examples

Input

?aa?
ab


Output

baab


Input

??b?
za


Output

azbz


Input

abcd
abacaba


Output

abcd

Note

In the first example string "baab" can be transformed to "abab" with swaps, this one has suitability of 2. That means that string "baab" also has suitability of 2.

In the second example maximal suitability you can achieve is 1 and there are several dozens of such strings, "azbz" is just one of them.

In the third example there are no '?' characters and the suitability of the string is 0.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
vector<bool> visited(100005, false);
vector<long long> adj[100005];
vector<long long> parent(100005, -1);
long long ans1 = 0;
long long expo(long long x, long long n, long long M) {
  if (n == 0)
    return 1;
  else if (n % 2 == 0)
    return (expo((x * x) % M, n / 2, M)) % M;
  else
    return (x * expo((x * x) % M, (n - 1) / 2, M)) % M;
}
bool sortbysec(pair<pair<long long, long long>, long long> p1,
               pair<pair<long long, long long>, long long> p2) {
  if (p1.first.first == p2.first.first)
    return p1.first.second > p2.first.second;
  return p1.first.first < p2.first.first;
}
void dfs(long long v) {
  visited[v] = true;
  ans1++;
  if (adj[v].size() == 0) return;
  for (long long j = 0; j < adj[v].size(); j++) {
    if (!visited[adj[v][j]]) dfs(adj[v][j]);
  }
}
long long find(vector<long long> &parent, long long i) {
  while (parent[i] != i) {
    parent[i] = parent[parent[i]];
    i = parent[i];
  }
  return parent[i];
}
void Union(vector<long long> &parent, long long i, long long j) {
  long long x = find(parent, i);
  long long y = find(parent, j);
  parent[x] = y;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long i, j, k, a, b, c, t, x, y, n, m, z, flag = 0, ans = 0, sum = 0;
  t = 1;
  while (t--) {
    string st, s, t;
    cin >> s >> t;
    map<char, long long> mp;
    vector<char> ans;
    for (i = 0; i < s.size(); i++) {
      mp[s[i]]++;
    }
    while (1) {
      for (i = 0; i < t.size(); i++) {
        if (mp[t[i]] > 0) {
          mp[t[i]]--;
        } else if (mp['?'] > 0) {
          ans.push_back(t[i]);
          mp['?']--;
        } else {
          flag = 1;
          break;
        }
      }
      if (flag == 1) break;
    }
    j = 0;
    for (i = 0; i < s.size(); i++) {
      if (s[i] == '?') {
        s[i] = ans[j];
        j++;
      }
    }
    cout << s;
  }
  return 0;
}