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: Accepted)

object Main{
  def ok(s:String,t:String) : Boolean = {
    if(s.length != t.length){
      return false
    }else{
      for(i <- 0 to s.length-1){
        if(s(i)!=t(i) && s(i)!='?') return false
      }
      true
    }
  }
  def gen(s:String,t:String,idx:Int) : String = {
    var sc = s.toCharArray
    for(i <- 0 to t.length-1) sc(idx+i) = t(i)
    for(i <- 0 to sc.length-1) if(sc(i) == '?') sc(i) = 'a'
    sc.mkString
  }


  def main(args:Array[String]) = {
    val sc = new java.util.Scanner(System.in)
    val s,t = sc.nextLine
    val n = s.length
    val m = t.length
    val end = "z" * 100

    val ar = for(i <- 0 to n-1) yield {
      val sub = s.slice(i,i+m)
      val isok = ok(sub,t)
      if(isok) gen(s,t,i)
      else end
    }
    val ans = ar.filter(x=>x.length>0).min
    if(ans.length <= 50) println(ans)
    else println("UNRESTORABLE")
  }
}