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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskC {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            String s = in.next();
            String t = in.next();
            StringBuilder sb = new StringBuilder();
            for (int i = s.length() - 1; i >= t.length() - 1; i--) {
                char c = s.charAt(i);
                if (c == '?' || c == t.charAt(t.length() - 1)) {
                    for (int j = t.length() - 1; j >= 0; j--) {
                        char cs = s.charAt(i + j - t.length() + 1);
                        char ct = t.charAt(j);
                        if (cs != '?' && cs != ct) break;
                        if (j == 0) {
                            sb.append(s.substring(0, i - t.length() + 1));
                            sb.append(t);
                            sb.append(s.substring(i + 1, s.length()));
                            for (int k = 0; k < sb.length(); k++) if (sb.charAt(k) == '?') sb.replace(k, k + 1, "a");
                            out.println(sb);
                            return;
                        }
                    }
                }
            }
            out.println("UNRESTORABLE");
        }

    }
}

