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 JavaScript (node.js v5.12) (judge verdict: Runtime Error)

"use strict"

function main(input) {
  input = input.split(/\n/)
  let S = input[0].split("")
  const T = input[1].split("")

  if (S.length < T.length) {
    console.log(ans)
    return
  } else {
    for (let i = S.length - T.length; i >= 0; i--) {
      //
      let x = 0
      for (let j = 0; j < T.length; j++) {
        //Tの区間の中で合致するかどうか
        if (S[i + j] == T[j] || S[i + j] == "?") {
          //この文字は合致、または?だからパス
        } else {
          //合致しない＞この区間は合致しない
          x++
          continue
        }
        //
      }
      if (x > 0) continue
      //continue されなかったので合致、Tで埋める
      // point = i
      //Tで埋める
      for (let k = 0; k < T.length; k++) {
        S[i + k] = T[k]
      }
      //残りの?をaに変換
      // S = S.replace(/(.+)/, "a")
      for (let i = 0; i < S.length; i++) {
        S[i] = S[i] == "?" ? "a" : S[i]
      }
      S = S.join("")

      console.log(S)
      return
    }
  }
  //
  console.log("UNRESTORABLE")
  //
}
main(require("fs").readFileSync("/dev/stdin", "utf8"))