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 java.lang.*;
public class Main{
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);

		String S = sc.next();
		String T = sc.next();
		int ss = S.length();
		int tt = T.length();
		char[] chS = new char[ss];
		char[] chT = new char[tt];
		for( int i=0; i<ss; i++ ){
			chS[i] = S.charAt(i);        
		}
		for( int i=0; i<tt; i++ ){
			chT[i] = T.charAt(i);       
		}
		int x = 0,y = 0,b = 0;
		loop:for( int i=0; i<=ss-tt; i++ ){
			int a = i;
			int count = 0;          
			for( int j=0; j<tt; j++ ){
				if( chS[a]=='?' || chS[a]==chT[j] ){
					count++;
				}
				if( count==tt ){
					x = i;
					y = i+tt-1;	
					b = 1;                  
				}  
				a++;              
			}            
		}
		if( ss==1 ){
			b = 0;          
        }          
		if( b==1 ){   //if start   
		for( int i=0; i<x; i++ ){
			if( chS[i]=='?' ){
				System.out.print("a");
			}else{
				System.out.print(chS[i]);
			}
		}
		for( int i=0; i<tt; i++ ){
			System.out.print(chT[i]);
		}
		for( int i=y+1; i<ss; i++ ){
			if( chS[i]=='?' ){
				System.out.print("a");
			}else{
				System.out.print(chS[i]);
			}
		}
        }      //if end
		if( ss==1 ){
			if( S.equals(T) || S.equals("?") ){
				System.out.println(T);              
            }else{
				System.out.println("UNRESTORABLE");              
            }              
        }else{
			if( x==0 && y==0 ){
				System.out.println("UNRESTORABLE");              
            }              
        }          
	}
}
