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.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.nextLine();
        int N = S.length();
        String T = sc.next();
        int M = T.length();

        String NOT = "UNRESTORABLE";

        if (M > N) {
            System.out.println(NOT);
            return;
        }

        NEXT: for (int i = 0; i <= N - M; i++) {
            int end = N - 1 - i;
            for (int j = 0; j < M; j++) {
                if (S.charAt(end - j) == '?' || S.charAt(end - j) == T.charAt(M - 1 - j)) continue;
                continue NEXT;
            }

            StringBuilder sb = new StringBuilder();
            for (int k = 0; k < N; k++) {
                if (k <= end && k >= end - M + 1) {
                    sb.append(T.charAt(k - (end - M + 1)));
                } else {
                    if (S.charAt(k) == '?') {
                        sb.append('a');
                    } else {
                        sb.append(S.charAt(k));
                    }
                }
            }
            System.out.println(sb.toString());
            return;
        }

        System.out.println(NOT);
    }
}