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.*;
import java.util.stream.Collectors;
import java.io.*;
import java.nio.charset.StandardCharsets;

public class Main {
	public static void main(String[] args) throws IOException {
		InputStreamReader reader = new InputStreamReader(System.in, StandardCharsets.UTF_8);
		BufferedReader in = new BufferedReader(reader);
		Main ins = new Main(in);
		ins.calc();
		ins.showResult();
	}

	char[] S, T;
	boolean enable = false;

	Main(BufferedReader in) throws IOException {
		S = in.readLine().toCharArray();
		T = in.readLine().toCharArray();
	}

	boolean isMatch(char[] s, char[] t) {
		boolean isMatch = true;
		for (int i = 0; i < t.length; ++i) {
			if (s[i] != '?' && s[i] != t[i]) {
				isMatch = false;
				break;
			}
		}
		return isMatch;
	}

	void calc() {
		for (int i = S.length - T.length; i >= 0; --i) {
			if (enable) {
				if (S[i] == '?') {
					S[i] = 'a';
				}
			} else {
				if (S[i] == '?' || S[i] == T[0]) {
					enable = isMatch(Arrays.copyOfRange(S, i, i + T.length), T);
					if (enable) {
						// 置き換え
						for (int j = 0; j < T.length; ++j) {
							S[i + j] = T[j];
						}
					}
				}
			}
		}
		if (!enable) {
			return;
		}
		// 最後に残った?を置き換える
		for (int i = 0; i < S.length; ++i) {
			if (S[i] == '?') {
				S[i] = 'a';
			}
		}
	}

	void showResult() {
		if (enable) {
			for (int i = 0; i < S.length; ++i) {
				System.out.print(S[i]);
			}
			System.out.println("");
		} else {
			System.out.println("UNRESTORABLE");
		}
	}
}