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 Lua (5.3.2) (judge verdict: Wrong Answer)

local S_dash=io.read()
local S_dash_copy=S_dash
local T=io.read()

for i=#S_dash-#T+1,1,-1 do
    local subS=S_dash:sub(i,#T+i-1)
    local flag=true
    for j=1,#T do
        if subS:sub(j,j)~="?" and subS:sub(j,j)~=T:sub(j,j) then
            flag=false
        elseif subS:sub(j,j)=="?" then
            flag=false
        elseif subS:sub(j,j)==T:sub(j,j) then
            flag=true
            break
        end
    end
    if flag then
        S_dash=S_dash:sub(1,i-1)..T..S_dash:sub(#T+i)
        break
    end
end
if S_dash==S_dash_copy then
    print("UNRESTORABLE")
else
    S=S_dash:gsub("?","a")
    print(S)
end