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<cstdio>
#include<cstring>
using namespace std;
char a[55],b[55];
int main()
{
	scanf("%s",a);
	scanf("%s",b);
	int pre=60;
	for(int i=0;i<strlen(a);i++)
	{
		int pd=1;
		for(int j=0;j<strlen(b);j++)
		    if(a[i+j]!=b[j]&&a[i+j]!='?'){pd=0;break;}
		if(pd)pre=i;
	}
	if(pre==60)printf("UNRESTORABLE");
	else 
	{
		for(int i=0;i<strlen(b);i++)
		    a[pre+i]=b[i];
		for(int i=0;i<strlen(a);i++)
		    if(a[i]=='?')a[i]='a';
		for(int i=0;i<strlen(a);i++)
		    printf("%c",a[i]);
	}
}
