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.*;
import static java.lang.Integer.*;
import static java.lang.Long.*;
import static java.lang.Math.*;
import static java.lang.System.*;

public class Main {
	public static String UN = "UNRESTORABLE";
	public static void main(String[] args) {
		int i=0,j=0,k=0;
		Scanner sc = new Scanner(in);
		char[] s = sc.next().toCharArray();
		char[] t = sc.next().toCharArray();
		sc.close();
		boolean f=false;
		int d = s.length - t.length;
		ArrayList<String> ans = new ArrayList<>();
		for (i = 0; i <= d; i++) {
			char[] ss = new char[s.length];
			for (j = 0; j < i; j++) {
				ss[j]=s[j]=='?'?'a':s[j];
			}
			for (j = 0; j < t.length; j++) {
				if(s[i+j]!=t[j]&&s[i+j]!='?') {
					break;
				}
				ss[i+j]=t[j];
			}
			if(j==t.length) {
				for (j=i+t.length;j < s.length; j++) {
					ss[j]=s[j]=='?'?'a':s[j];
				}
				ans.add(new String(ss));
				f=true;
			}
		}
		Collections.sort(ans);
		out.println(f?ans.get(0):UN);
	}
}
