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;

int main(){
	char s[52], t[52];
	scanf("%s%s", s, t);
	int n = strlen(s), m = strlen(t), f, p;
	for(int i = n-m;i >= 0;i--){
		f = 0, p = i;
		for(int j = i;j < i+m;j++){
			if(s[j] == '?')continue;
			if(s[j] != t[j-i])f = 1;
		}
		if(f == 0)break;
		if(i == 0 && f == 1)p = -1;
	}
	if(p == -1)printf("UNRESTORABLE\n");
	else{
		for(int i = 0;i < n;i++){
			if(p <= i && i < p+m)printf("%c", t[i-p]);
			else{
				if(s[i] == '?')printf("a");
				if(s[i] != '?')printf("%c", s[i]);
			}
		}
	}
	return 0;
}