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 <iostream>
#include <string>
using namespace std;

int main()
{
	string s,ch;
	int i,j,k,m;
	cin >> s >> ch;
	for(i=s.size()-1,m=ch.size();i-m+1>=0;i--)
	{
		for(j=i-m+1,k=0;k<m;j++,k++)
			if(s[j]!='?' && s[j]!=ch[k]) break;
		if(k==ch.size()) break;
	}
	if(i-m+1<0)
	{
		puts("UNRESTORABLE");
		return 0;
	}
	for(j=i-ch.size()+1,k=0;k<ch.size();j++,k++)
		s[j]=ch[k];
	for(i=0;i<s.size();i++)
		if(s[i]=='?') s[i]='a';
	cout << s << "\n";
}