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 Python (3.4.3) (judge verdict: Wrong Answer)


S = list(input())
T = list(input())

if len(S) < len(T):
    print("UNRESTORABLE")

else:
    solved = False
    ind = -1
    for i in reversed(range(len(S) - len(T) + 1)):
        s = S[i:i+len(T)]
        
        yes = True
        for j in range(len(s)):
            print(T[j], s[j])
            if s[j] == '?' or s[j] == T[j]:
                continue
            else:
                yes = False
                break
        if yes:
            ind = i
            solved = True
            break

    if not solved:
        print("UNRESTORABLE")
    else:
        for i in range(len(S)):
            if i < ind:
                if S[i] == '?':
                    S[i] = 'a'
            elif ind<= i < ind+len(T):
                S[i] = T[i-ind]

    print(''.join(S))