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.util.Scanner;

public class Main {
    private static Scanner sc;

    public Main() {
    }

    public static void main(String[] args) {
        sc = new Scanner(System.in);
        new Main().solve();

    }

    private void solve() {
        String Sd = sc.next();
        String T = sc.next();
        char[] sd = Sd.toCharArray();
        char[] t = T.toCharArray();
        int tlen = t.length;
        String tmp = "";
        int tleft = 9999;
        for (int i = Sd.length() - 1;;) {
            int left = i - tlen + 1;
            if (left < 0) {
                break;
            }

            if (check(left, i, sd, t)) {
                tmp = new String(t);
                tleft = left;
                break;
            }
            i--;
        }

        if (tleft == 9999) {
            System.out.println("UNRESTORABLE");
        } else {
            // System.out.println(Sd.substring(0, tleft).replaceAll("\\?", "a")
            // + tmp);
            StringBuilder sb = new StringBuilder();
            sb.append(Sd);
            sb.replace(tleft, tleft + tlen, tmp);
            System.out.println(sb.toString().replaceAll("\\?", "a"));
        }
    }

    boolean check(int s, int g, char[] sd, char[] t) {
        int ti = 0;
        for (int i = s; i <= g; i++) {
            if (sd[i] != '?' && sd[i] != t[ti]) {
                return false;
            }
            ti++;
        }
        return true;
    }
}
