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
#define _LIBCPP_DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=int(a);i<int(b);i++)
typedef vector<int> vi;
typedef long long ll;


int main(){
    string s,t;cin>>s>>t;
    int pos=-1,ok=1;
    rep(i,0,s.size()-t.size()+1){
        ok=1;
        rep(j,0,t.size()){
            if(s[i+j]!=t[j]&&s[i+j]!='?')ok=0;
        }
        if(ok==1)pos=i;
    }
    rep(j,pos,pos+t.size()){
        s[j]=t[j-pos];
    }
    rep(i,0,s.size())if(s.at(i)=='?')s.at(i)='a';
    
    if(pos!=-1)cout<<s<<endl;
    else cout<<"UNRESTORABLE"<<endl;
}




