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;
void die()
{
	cout<<"UNRESTORABLE\n";
	exit(0);
}
int main()
{
	string S,T;
	cin>>S>>T;
	int LS=S.length(),LT=T.length(),Last_Pos;
	bool Flag=false;
	for(int i=0;i<LS-LT+1;i++)
	{
		bool F=true;
		for(int j=0;j<LT;j++)
			if(S[i+j]!=T[j]&&S[i+j]!='?')
			{
				F=false;
				break;
			}
		if(F)
			Last_Pos=i,
			Flag=true;
	}
	if(!Flag)
		die();
	for(int i=0;i<LS;i++)
		if(S[i]=='?')
			S[i]='a';
	cout<<S.substr(0,Last_Pos)<<T<<S.substr(Last_Pos+LT)<<endl;
	return 0;
}
