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>

char a[55], b[55];
int lena, lenb;

bool chk(int det) {
	for(int i=0;i<lenb;i++)
		if(a[det+i] != '?' && a[det+i] != b[i]) return false;
	return true;
}

int main() {
	scanf("%s%s", a, b);
	lena = strlen(a); lenb = strlen(b);
	int p=-1;
	for(int i=lena-lenb;i>=0 && p<0;i--) {
		if(chk(i)) p = i;
	}
	if(p<0) puts("UNRESTORABLE");
	else {
		for(int i=0;i<lenb;i++)
			a[p+i] = b[i];
		for(int i=0;i<lena;i++)
			if(a[i]=='?') a[i] = 'a';
		printf("%s\n", a);
	}
	
	return 0;
}