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.

Examples

Input

?tc????
coder


Output

atcoder


Input

??p??d??
abc


Output

UNRESTORABLE
import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        new Main().compute();
    }

    void compute() {
        Scanner sc = new Scanner(System.in);
        String Sprime = sc.next();
        String T = sc.next();
        String S[] = new String[Sprime.length() - T.length() + 1];
        check:
        for (int i = Sprime.length() - T.length(); i >= 0; i--) {
            for (int j = 0; j < T.length(); j++) {
                if (T.charAt(j) == Sprime.charAt(i + j) || Sprime.charAt(i + j) == '?') {
                } else {
                    continue check;
                }
            }
            S[i] = "";
            for (int j = 0; j < Sprime.length(); j++) {
                if (j >= i && j < i + T.length()) {
                    S[i] += T.charAt(j - i);
                } else if (Sprime.charAt(j) == '?') {
                    S[i] += 'a';
                } else {
                    S[i] += Sprime.charAt(j);
                }
            }
        }
        boolean flag = false;
        String ans = "zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz";
        for (int i = 0; i < Sprime.length() - T.length()+1; i++) {
            if (S[i] != null && ans.compareTo(S[i]) >= 0) {
                flag = true;
                ans = S[i];
            }
        }
        if (flag) {
            System.out.println(ans);
        } else {
            System.out.println("UNRESTORABLE");
        }
    }
}
