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

int main()
{
	string s,t; cin>>s>>t;
	int ns=s.length(),nt=t.length();

	bool judge=false;
	for(int i=ns-nt;i>=0;i--){
		if(s[i]==t[0] or s[i]=='?'){
			bool flag=true;
			rep(j,nt){
				if(s[i+j]!=t[j]){
					if(s[i+j]=='?') continue;
					else flag=false;
				}
			}
			if(flag){
				rep(j,nt) s[i+j]=t[j];
				rep(j,ns){
					if(s[j]=='?') s[j]='a';
				}
				judge=true; break;
			}
		}
	}
	if(judge) cout<<s<<endl;
	else cout<<"UNRESTORABLE"<<endl;
	return 0;
}
