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>
using namespace std;
int main(void){
    string s,t,u="UNRESTORABLE";
    cin>>s>>t;
    int a=s.length(),b=t.length();
    for(int i=a-b;i>=0;i--){
        bool f=true;
        for(int j=0;j<b;j++){
            if(s[i+j]!='?'&&s[i+j]!=t[j]){
                f=false;
            }
        }
        if(f){
            u=s.substr(0,i)+t+s.substr(i+b);
            for(int j=0;j<a;j++){
                if(u[j]=='?'){
                    u[j]='a';
                }
            }
            i=0;
        }
    }
    cout<<u<<endl;
}
