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.*;

class Main {

	public static void main(String[] args) throws Exception {
		final Scanner sc = new Scanner(System.in);
		char[] s = sc.next().toCharArray();
		char[] t = sc.next().toCharArray();
		int index = -1;
		for (int i = s.length - t.length; i >= 0; i--) {
			boolean find = true;
			for (int j = 0; j < t.length; j++) {
				if (s[i + j] == '?') continue;
				if (t[j] != s[i + j]) {
					find = false;
					break;
				}
			}
			if (find) {
				index = i;
				break;
			}
		}

		if (index == -1) {
			System.out.println("UNRESTORABLE");
			return;
		}
		for (int i = 0; i < s.length; i++) {
			if (i < index) {
				if (s[i] == '?') s[i] = 'a';
			} else if (i < index + t.length) {
				s[i] = t[i - index];
			} else {
				if (s[i] == '?') s[i] = 'a';
			}
		}

		System.out.println(s);
	}
}
