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,ss;
int main()
{
	cin >>s>>ss;
	for (int i=s.size()-ss.size();i>=0;i--)
	{
		bool fl=1;
		for (int j=0;j<ss.size();j++)
		{
			if (s[i+j]=='?') continue;//跳过下面语句直接进入下一个循环 
			if (s[i+j]!=ss[j])         
			{
				fl=0;
				break;                //结束循环
			}
		}
		if (fl)                   //没有break，匹配成功 
		{
		    for (int j=0;j<ss.size();j++) if (s[i+j]=='?') s[i+j]=ss[j];
		    for (int j=0;j<s.size();j++) if (s[j]=='?') s[j]='a';
		    cout <<s;
		    return 0;
		}
	}
	cout <<"UNRESTORABLE";
	return 0;
}