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 scanner = new Scanner(System.in);
        String S = scanner.nextLine();
        String T = scanner.nextLine();
        StringBuilder sb = new StringBuilder();
        if (S.length() < T.length()) {
            System.out.println("UNRESTORABLE");
            return;
        }


        for (int i = S.length() - T.length(); i >= 0; i--) {
            if (check(i, S, T)) {
                answers(i, S, T);
                return;
            }
        }

        System.out.println("UNRESTORABLE");

    }

    private static boolean check(int x, String a, String b) {
        for (int i = 0; i < b.length(); i++) {
            if (a.charAt(x) != b.charAt(i) && a.charAt(x) != '?')
                return false;
            x++;
        }
        return true;
    }

    private static void answers(int start, String a, String b) {
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < a.length(); i++) {
            if (i == start) {
                sb.append(b);
                i += b.length() - 1;
            } else if (a.charAt(i) == '?') {
                sb.append('a');
            } else {
                sb.append(a.charAt(i));
            }
        }
        System.out.println(sb.toString());
    }

}


