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 s[50 + 5], t[50 + 5];

int main() {
	scanf("%s%s", s, t);
	int L = strlen(s), l = strlen(t);
	int test = 0;
	for (int i = L - 1;i >= l - 1;i--) {
		for (int j = 0;j < l;j++) {
			if (s[i - j] == '?')continue;
			if (s[i - j] != t[l - 1 - j])goto A;
		}
		test = 1;
		for (int j = 0;j < l;j++)s[i - j] = t[l - 1 - j];
		break;
	A:continue;
	}
	if (test) {
		for (int i = 0;i < L;i++)if (s[i] == '?')s[i] = 'a';
		printf("%s", s);
	}
	else printf("UNRESTORABLE");
	return 0;
}