Problem:
Score : 300 points

Problem Statement

E869120 found a chest which is likely to contain treasure.

However, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.

He also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.

One more thing he found is a sheet of paper with the following facts written on it:

Condition 1: The string S contains a string T as a contiguous substring.

Condition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.

Print the string S.

If such a string does not exist, print UNRESTORABLE.

Constraints

1 \leq |S'|, |T| \leq 50

S' consists of lowercase English letters and ?.

T consists of lowercase English letters.

Input

Input is given from Standard Input in the following format:

S
T'

Output

Print the string S.

If such a string does not exist, print UNRESTORABLE instead.

Sample Input 1

?tc????
coder

Sample Output 1

atcoder

There are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.
Among them, the lexicographically smallest is atcoder, so we can say S = atcoder.

Sample Input 2

??p??d??
abc

Sample Output 2

UNRESTORABLE

There is no string that satisfies Condition 1, so the string S does not exist.

Solution in C++14 (GCC 5.4.1) (judge verdict: Accepted)

#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <set>
#include <algorithm>
#include <array>
#include <complex>
#include <string>
#include <utility>
#include <map>
#include <queue>
#include <list>
int dx[4] = { -1,0,1,0 };
int dy[4] = { 0,1,0,-1 };
#define INF 1<<21
using pii = std::pair<int, int>;
#define SORT(v) std::sort(v.begin(), v.end())
int main(void) {
    int N;
    std::string ans;
    std::string s, t;
    std::cin >> s >> t;
    bool make = false;
    std::vector<std::string> ans_s;
    if (s.size() < t.size()) {
        std::cout << "UNRESTORABLE" << std::endl;
        return 0;
    }
    for (int i = 0; i <= s.size() - t.size(); i++) {
        make = true;
        for (int j = 0; j < t.size(); j++) {
            if (s[i + j] != '?'&&s[i + j] != t[j]) {
                make = false;
                break;
            }
        }
        if (make) {
            ans = s;
            for (int j = 0; j < t.size(); j++) {
                ans[i + j] = t[j];
            }
            for (int j = 0; j < ans.size(); j++) {
                if (ans[j] == '?') {
                    ans[j] = 'a';
                }
            }
            ans_s.push_back(ans);
        }
        

    }
    SORT(ans_s);
    if (!ans_s.empty()) {
        std::cout << ans_s[0] << std::endl;
    }
    else {
        std::cout << "UNRESTORABLE" << std::endl;
    }
    return 0;
}