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 <iostream>
#include <cstdio>
using namespace std;

string a, b, ans;
int main()
{
	int i, j, k;
	cin >> a >> b;
	for (i = a.size(); i >= 0; i--) {
		for (j = 0; j < b.size(); j++) {
			if (i + j >= a.size() || a[i + j] != b[j] && a[i + j] != '?') break;
		}
		if (j == b.size()) break;
	}
	if (i < 0) {
		cout << "UNRESTORABLE";
		return 0;
	}
	k = i;
	for (i = 0; i < a.size(); i++) {
		if (k <= i && i < k + b.size()) ans += b[i - k];
		else if (a[i] == '?') ans += 'a';
		else ans += a[i];
	}
	cout << ans;
    return 0;
}
