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>

#define rep(i,n) for(int i=0;i<(n);i++)

using namespace std;

int main(){
	string s,t; cin>>s>>t;
	int n=s.length(),m=t.length();

	if(n<m){ cout<<"UNRESTORABLE"<<endl; return 0; }

	string ans="~";
	rep(i,n-m+1){
		bool ok=true;
		string r=s;
		rep(j,m){
			if(s[i+j]=='?'){
				r[i+j]=t[j];
			}
			else if(s[i+j]!=t[j]){
				ok=false;
			}
		}
		if(!ok) continue;

		rep(j,n) if(r[j]=='?') r[j]='a';
		ans=min(ans,r);
	}
	cout<<(ans=="~"?"UNRESTORABLE":ans)<<endl;

	return 0;
}
