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) throws Exception {
		Scanner sc = new Scanner(System.in);
		String s = sc.next();
		String t = sc.next();
		sc.close();

		String ans = "zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz";
		int n = s.length() - t.length() + 1;
		for (int i = 0; i < n; i++) {
			if (match(s, t, i)) {
				String str = s.substring(0, i) + t + s.substring(i + t.length(), s.length());
				str = str.replaceAll("\\?", "a");
				if (str.compareTo(ans) < 0) {
					ans = str;
				}
			}
		}
		if ("zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz".equals(ans)) {
			System.out.println("UNRESTORABLE");
		} else {
			System.out.println(ans);
		}
	}

	static boolean match(String s, String t, int idx) {
		for (int i = 0; i < t.length(); i++) {
			char ch = s.charAt(idx + i);
			if (ch != '?' && ch != t.charAt(i)) {
				return false;
			}
		}
		return true;
	}
}
