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) {
		try(Scanner scan = new Scanner(System.in)){
			
			String Sd = scan.next();
			String T = scan.next();
			char[]s = new char[Sd.length()];
			char[]t = new char[T.length()];
			s = Sd.toCharArray();
			t = T.toCharArray();
			
			if(t.length>s.length) {
				System.out.println("UNRESTORABLE");
				System.exit(0);
			}
			
			for(int i = s.length-t.length;i>=0;i--) {
				int count = 0;
				for(int j = 0;j<t.length;j++) {
					if(t[j]==s[i+j]||s[i+j]=='?')count++;
					
					
					
				}
				if(count==t.length) {
					
					Sd = Sd.substring(0, i)+T+Sd.substring(i+t.length,Sd.length());
					Sd = Sd.replace('?','a');
					
					System.out.println(Sd);
					System.exit(0);
				}
			}
			
			System.out.println("UNRESTORABLE");
			
			
			
		}
		
		
	}
		

}
