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.next().toCharArray();
		char[] t = sc.next().toCharArray();
		int S = s.length; int T = t.length;
		boolean flg2 = false;
		for(int i = S - T ; i >= 0 ; i--) {
			boolean flg = true;
			for(int j = 0 ; j < T ; j++) {
				if(s[j + i] != t[j] && s[j + i] != '?') {
					flg = false;
				}
			}
			if(flg) {
				for(int j = 0 ; j < T ; j++) {
					s[j + i] = t[j];
					flg2 = true;
				}
				break;
			}
		}
		if(flg2) {
			for(int i = 0 ; i < S ; i++) {
				if(s[i] == '?') s[i] = 'a';
			}
			String ans = String.valueOf(s);
			System.out.println(ans);
		} else {
			System.out.println("UNRESTORABLE");
		}

	}
}