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<string>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
using namespace std;

int main(){
	string s,t;
	cin>>s>>t;
	bool tmp=false;
	for(int i=s.size()-t.size();i>=0;i--){
		bool check=true;
		rep(j,t.size()){
			if(s[i+j]=='?' or s[i+j]==t[j])continue;
			check=false;
			break;
		}
		if(check && !tmp){
			rep(j,t.size())s[i+j]=t[j];
			tmp=true;
		}
	}
	rep(i,s.size())if(s[i]=='?')s[i]='a';
	cout<<((tmp)?s:"UNRESTORABLE")<<endl;
	return 0;
}