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);
		
		char []s = sc.next().toCharArray();
		String t = sc.next();
		
		int n = s.length;
		int m = t.length();
		
		if(n < m) {
			System.out.println("UNRESTORABLE");
			return;
		}
		
		int cnt = m-1;
		int num = -1;
		
		for(int i = n-1 ;i >= 0 ;i--) {
			if(s[i] =='?' || s[i] == t.charAt(cnt)) {
				cnt--;
			}
			else {
				cnt = m-1;
			}
			if(cnt == -1) {
				num = i;
				break;
			}
			
		}
		
		cnt = 0;
		
		for(int i = 0 ;i < n ;i++) {
			if(num > i || cnt == m) {
				if(s[i] == '?') {
					s[i] = 'a';
				}
			}
			else {
				s[i] = t.charAt(cnt);
				cnt++;
			}
		}
		
		String ans = String.valueOf(s);
		if(cnt != -1) {
			System.out.println("UNRESTORABLE");
			return;
		}
		System.out.println(ans);
	}
}