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: Wrong Answer)

main = do
  s <- getLine :: IO String
  t <- getLine :: IO String
  let f = find s t 0 []
  let rsl = if null f 
         then "UNRESTORABLE" 
         else minimum $ [remake s t i | i<-f]
  putStrLn rsl

find :: String -> String -> Int -> [Int] -> [Int]
find s t i xs
  | length s < lt = xs
  | complete || contain || allq = find (tail s) t (i+1) (i:xs)
  | otherwise = find (tail s) t (i+1) xs
    where
      lt = length t
      taken = take lt s
      contain = or $ zipWith (==) t taken
      allq = taken == (replicate lt '?')
      complete = taken == t

remake :: String -> String -> Int -> String
remake s t i = (replace prev) ++ t ++ (replace front) 
  where
    prev = take i s
    front = drop (length prev+length t) s
    replace :: String -> String
    replace [] = []
    replace (x:xs)
      | x == '?' = 'a' : replace xs
      | otherwise = x : replace xs