Problem:
Score : 300 points

Problem Statement

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.

Sample Input 1

?tc????
coder

Sample Output 1

atcoder

There are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.
Among them, the lexicographically smallest is atcoder, so we can say S = atcoder.

Sample Input 2

??p??d??
abc

Sample Output 2

UNRESTORABLE

There is no string that satisfies Condition 1, so the string S does not exist.

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String S = sc.nextLine();
		char[] T = sc.nextLine().toCharArray();
		sc.close();
		String result = "UNRESTORABLE";
		StringBuilder sb = new StringBuilder();
		int indexS = 0;
		if (T.length <= S.length()) {
			boolean isTargetMain = false;
			for (int i = 0; i < T.length; i++) {
				indexS = S.indexOf(T[i]);
				if (S.length() - (indexS + 1) >= (T.length - (i + 1))
						&& indexS >= i) {
					boolean isTarget = true;
					int count = indexS;
					for (int j = i; j < T.length; j++) {
						if (S.charAt(count) != T[j] && S.charAt(count) != '?') {
							isTarget = false;
							break;
						}
						count++;
					}
					if (isTarget) {
						count = indexS - i;
						for (int j = 0; j < i; j++) {
							if (S.charAt(count) != T[j] && S.charAt(count) != '?') {
								isTarget = false;
								break;
							}
						}
						count++;
					} else {
						continue;
					}
					
					if (isTarget) {
						for (int k = 0; k < S.length(); k++) {
							if (k == indexS) {
								sb.append(T);
								k += T.length - 1;
							} else if (S.charAt(k) == '?') {
								sb.append('a');
							} else {
								sb.append(S.charAt(k));
							}
						}
						result = sb.toString();
						isTargetMain = true;
						break;
					}
				}
			}
			if (!isTargetMain) {
				StringBuilder sb1 = new StringBuilder();
				for (int i = 0; i < T.length; i++) {
					sb1.append('?');
				}
				indexS = S.indexOf(sb1.toString());
				if (indexS >= 0) {
					for (int k = 0; k < S.length(); k++) {
						if (k == indexS) {
							sb.append(T);
							k += T.length - 1;
						} else if (S.charAt(k) == '?') {
							sb.append('a');
						} else {
							sb.append(S.charAt(k));
						}
					}
					result = sb.toString();
				}
			}
			
		}
		System.out.println(result);
	}
}