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) {
		Scanner sc = new Scanner(System.in);
		char[] s = sc.nextLine().toCharArray();
		char[] t = sc.nextLine().toCharArray();
		int ns = s.length, nt = t.length;
		if(!check(s, t, ns, nt)) {
			System.out.println("UNRESTORABLE");
			return;
		}
		for(int i = 0 ; i < ns ; i++) {
			if(s[i] == '?') {
				for(char c = 'a' ; c <= 'z' ; c++) {
					s[i] = c;
					if(check(s, t, ns, nt)) {
						break;
					}
				}
			}
		}
		String ans = "";
		for(int i = 0 ; i < ns ; i++) {
			ans += s[i];
		}
		System.out.println(ans);
	}

	public static boolean check(char[] s, char[] t, int ns, int nt) {
		for(int i = 0 ; i < ns - nt + 1 ; i++) {
			boolean ok = true;
			for(int j = 0 ; j < nt ; j++) {
				if(s[i + j] == t[j] || s[i + j] == '?');
				else ok = false;
			}
			if(ok) return true;
		}
		return false;
	}

}