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 Haskell (GHC 7.10.3) (judge verdict: Accepted)

import Data.Maybe
import Data.List

data Dubious a = Fixed a | Unfixed deriving Show


main = do
  s <- getLine >>= return . (map (\x -> if x=='?' then Unfixed else (Fixed x))) :: IO [Dubious Char]
  t <- getLine >>= return . (map (\x -> Fixed x)) :: IO [Dubious Char]

  let
    lent = length t
    lens = length s

  
  putStrLn $ func3 (sort (map (map func2) (catMaybes [func s t i | i<-[0..lens-lent]])))


  where
    equalDubious :: Eq a => Dubious a -> Dubious a -> Bool
    equalDubious Unfixed y = True
    equalDubious x Unfixed = True 
    equalDubious (Fixed x) (Fixed y) = if x/=y then False else True
    

    fix :: Eq a => Dubious a -> Dubious a -> Dubious a
    fix Unfixed (Fixed a) = Fixed a
    fix (Fixed a) Unfixed = Fixed a
    fix Unfixed Unfixed = Unfixed
    fix (Fixed a) (Fixed b) = if a/=b then Unfixed else Fixed a



    func s t i = if and (zipWith equalDubious t s') then (Just r) else Nothing
      where
        lt = length t
        ls = length s
        s' = take lt (drop i s)
        r = zipWith fix s ((take i (repeat Unfixed)) ++ t ++ (take (ls-i-lt) (repeat Unfixed)))

    func2 :: Dubious Char -> Char
    func2 (Fixed x) = x
    func2 Unfixed = 'a'

    func3 :: [String] -> String
    func3 [] = "UNRESTORABLE"
    func3 xs = head xs