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
//intのオーバーフローに気をつけろ,AGCはだいたいlongにしておけ
//nextLineよりnextだ
//読み込みは先に全部やっておけ
//for文を回す回数を気をつけろ

import java.util.Scanner;

public class Main {

	public static void main(String args[]) throws InterruptedException {
		    Scanner sc = new Scanner(System.in);

		    String s = sc.next();
		    String t = sc.next();
		    int count = 0;
		    int counter = 0;
		    
		    for(int i = 0; i <= s.length()-t.length(); i++) {
		    	
		    	for(int j = 0; j < t.length(); j++) {
		    		if(s.substring(s.length()-t.length()+j-i, s.length()-t.length()+j-i+1)
		    				.equals(t.substring(j, j+1)) ||
		    				s.substring(s.length()-t.length()+j-i, s.length()-t.length()+j-i+1).equals("?")) {
		    			count++;
		    		}
		    	}
		    	
		    	if(count == t.length()) {
		    		s = s.substring(0,s.length()-t.length()-i) + t + s.substring(s.length()-i);
		    		counter++;
		    		break;
		    	}else {
		    		count = 0;
		    		continue;
		    	}
		    }
		    if(counter == 0) {
		    	System.out.println("UNRESTORABLE");
		    }else {
		    	s = s.replace("?", "a");
		    	System.out.println(s);
		    }
		    
		    
		    
		    sc.close(); }

	public static  int gcd(int a, int b) {
	    if (a < b) {
	        int tmp = a;
	        a = b;
	        b = tmp;
	    }

	    int r = -1;
	    while (r != 0) {
	        r = a % b;
	        a = b;
	        b = r;
	    }

	    return a;
	}
}
