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 ans="";
void make(string s,string t,int curs)
{
	int i;
	for(i=0;i<s.size();i++)
	{
		if(i<curs||i>=curs+t.size())
		{
			if(s[i]=='?')
				s[i]='a';
		}
		else
		{
			if(s[i]=='?')
				s[i]=t[i-curs];
			if(s[i]!=t[i-curs])
				return;
		}
	}
	ans=min(ans,s);
	if(ans=="")
		ans=s;
}
int main(){
	int i;
	string s,t;
	cin>>s>>t;
	for(i=0;i<s.size()-t.size()+1;i++)
		make(s,t,i);
	if(ans=="")
		cout<<"UNRESTORABLE";
	else
		cout<<ans;
	return 0;
}