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 Go (1.6) (judge verdict: Accepted)

package main

import "fmt"

func main() {
	var sp, t string
	fmt.Scan(&sp, &t)

	begin := make([]int, 0)
	for i := 0; i < len(sp); i++ {
		flag := false
		for j := 0; j < len(t) && i+j < len(sp); j++ {
			if !(sp[i+j] == t[j] || sp[i+j] == '?') {
				break
			}
			if j == len(t)-1 {
				flag = true
			}
		}
		if flag {
			begin = append(begin, i)
		}
	}

	if len(begin) == 0 {
		fmt.Println("UNRESTORABLE")
		return
	}

	candinates := make([]string, len(begin))
	for j, k := range begin {
		s := ""
		for i := range sp {
			if i >= k && i < k+len(t) {
				s += string(t[i-k])
			} else if sp[i] == '?' {
				s += string('a')
			} else {
				s += string(sp[i])
			}
		}
		candinates[j] = s
	}

	var min string
	for i, str := range candinates {
		if i == 0 || str < min {
			min = str
		}
	}
	fmt.Println(min)
}