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.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;

public class Main {

	private static final String NOT_FOUND = "UNRESTORABLE";

	public static void main(String[] args) {
		new Main().execute();
	}

	public void execute() {
		Scanner sc = new Scanner(System.in);

		final String sDash = sc.next();
		final String T = sc.next();
		List<String> candidates = new ArrayList<>();
		for (int i = 0, bound = sDash.length() - T.length(); i <= bound; i++) {
			if (fuzzyMatch(sDash.substring(i, i + T.length()), T)) {
				String c = sDash.substring(0, i).replace('?', 'a') + T
						+ sDash.substring(i + T.length(), sDash.length()).replace('?', 'a');
				candidates.add(c);
			}
		}

		if (candidates.size() > 0) {
			Collections.sort(candidates);
			System.out.println(candidates.get(0));
		} else {
			System.out.println(NOT_FOUND);
		}
		sc.close();
	}

	private boolean fuzzyMatch(String s, String t) {
		for (int i = 0, len = s.length(); i < len; i++) {
			if (s.charAt(i) != '?' && s.charAt(i) != t.charAt(i)) {
				return false;
			}
		}
		return true;
	}

}