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 Fortran (gfortran v4.8.4) (judge verdict: Accepted)

program abc076
    use,intrinsic :: iso_fortran_env
    implicit none
    character(50):: s,t
    character(50):: pred_s, ans
    integer(int32):: sn,tn,i,j
    logical:: contain

    read*, s
    read*, t
    sn = len_trim(s)
    tn = len_trim(t)
    ans = 'zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz'
    do i=1, (sn-tn+1)
        contain = .true.
        do j=1,tn
            if (s(i+j-1:i+j-1) == '?') cycle
            if (s(i+j-1:i+j-1) /= t(j:j)) contain = .false.
        end do
        if (.not. contain) cycle
        pred_s = s(1:i-1) // trim(t(:)) // s(i+tn:sn)
        do j=1,sn
            if (pred_s(j:j) == '?') pred_s(j:j) = 'a'
        end do
        ans = min(ans,pred_s)
    end do
    if (ans /= 'zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz') then
        print'(a)', trim(ans)
    else
        print'(a)', 'UNRESTORABLE'
    end if
end program abc076