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
#include<bits/stdc++.h>
using namespace std;
string s,r;

int ok(int p){
	for(int i=0;i<r.size();i++){
		if(s[p+i]!='?'&&s[p+i]!=r[i])return 0;
	}
	return 1;
}

int main(){
	int c=0;
	bool b=0;
	cin>>s>>r;
	for(int i=s.size()-r.size();i>=0;i--){
		if(ok(i)){
			for(int j=0;j<r.size();j++){
				s[i+j]=r[j];
			}
			b=1;
			break;
		}
	}
	if(b){
		for(int i=0;i<s.size();i++){
			cout<<(s[i]=='?'?'a':s[i]);
		}
		cout<<'\n';
	}else{
		cout<<"UNRESTORABLE\n";
	}
} 