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 Julia (0.5.0) (judge verdict: Wrong Answer)

parseInt(x) = parse(Int, x)
parseBigInt(x) = parse(BigInt, x)
parseFloat(x) = parse(Float64, x)
parseBigFloat(x) = parse(BigFloat, x)
parseMap(x::Array{SubString{String},1}) = map(parseInt, x)

function main()
    s=chomp(readline())
    t=chomp(readline())
    n=length(s)
    l=length(t)
    ans="UNRESTORABLE"
    flg1=false
    for i in n-l+1:-1:1
        tmp=s[i:i+l-1]
        if tmp==t
            ans=s
            flg1=true
            break
        end
    end
    if !flg1
        for i in n-l+1:-1:1
            tmp=s[i:i+l-1]
            flg=true
            for j in 1:l
                if tmp[j]!=t[j] && tmp[j]!='?'
                    flg=false
                    break
                end
            end
            if flg
                ans=s[1:i-1]*t
                break
            end
        end
    end
    for i in 1:length(ans)
        if ans[i]=='?'
            ans=ans[1:i-1]*"a"*ans[i+1:end]
        end
    end
    println(ans)
end
main()