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 Scala (2.11.7) (judge verdict: Wrong Answer)

object Main extends App {
	val N = scala.io.StdIn.readLine.toArray
	val K = scala.io.StdIn.readLine.toArray

	val KK = Array.ofDim[Char](K.size,K.size)
	for(i<-0 until K.size){
		for(j<-0 until K.size){
			KK(i)(j) = '?'
		}
		KK(i)(i) = K(i)
	}

	var flag = false
	var t = 0

	while(!flag && t < K.size){
		flag = N.mkString.contains(KK(t).mkString) || flag
		t = t + 1;
	}

	if(flag){
		val A = N.mkString.replace(KK(t-1).mkString,K.mkString)
		println(A.replaceAllLiterally("?","a"))
	}else{
		println("UNRESTORABLE")
	}
}