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
import java.io.*;
import java.util.ArrayList;
import java.util.Collections;

class Main{
    public static void main(String[] args) throws IOException{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String S = br.readLine();
        String T = br.readLine();
        ArrayList<String> ans = new ArrayList<>();
        for (int i=0;i<=S.length()-T.length();i++){
            if (dd(i,S,T)){
                ans.add(constract(i,S,T));
            }
        }
        if (ans.isEmpty()){
            System.out.println("UNRESTORABLE");
        } else {
            Collections.sort(ans);
            System.out.println(ans.get(0));
        }
    }

    static boolean dd(int k,String s,String t){
        for (int i=0;i<t.length();i++){
            // tのi文字目がsのi+k文字目と違う 且つ sのi+k文字目が?ではない
            // trueの条件 => tのi文字目がsのi+k文字目と同じ もしくは sのi+k文字目が?である
            if (!String.valueOf(t.charAt(i)).equals(String.valueOf(s.charAt(i+k))) && !String.valueOf(s.charAt(i+k)).equals("?")){
                return false;
            }
        }
        return true;
    }

    static String constract(int k,String s,String t){
        StringBuffer ans = new StringBuffer(s);
        for (int i=0;i<t.length();i++){
            ans.setCharAt(i+k,t.charAt(i));
        }
        for (int i=0;i<s.length();i++){
            if (String.valueOf(ans.charAt(i)).equals("?")){
                ans.setCharAt(i, 'a');
            }
        }
        return String.valueOf(ans);
    }
}