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: Runtime Error)

import java.util.*;

public class Main {
    public static void main(String[] args) throws Exception {
        // Your code here!
        Scanner sc = new Scanner(System.in);
        String s = sc.next();
        String t = sc.next();
        char[] S = s.toCharArray();
        char[] T = t.toCharArray();
        int slen = S.length;
        int tlen = T.length;
        char[] ans = null;
        boolean flg = false;
        if(s.indexOf(t)>=0) flg = true;
        for(int i=slen-tlen;i>=0;i--){
            if(diffCheck(S, T, i)){
                char[] tans = S.clone();
                for(int j=i;j<i+tlen;j++){
                    tans[j] = T[j-i];
                }
                if(ans == null || diff(ans,tans)>0){
                    ans = tans;
                }
            }
        }
        for(int i=0;i<ans.length;i++) ans[i]=ans[i]=='?'?'a':ans[i];
        System.out.println(String.valueOf(ans));
    }
    private static int diff(char[] a, char[] b){
        for(int i=0,e=a.length;i<e;i++){
            char c1 = a[i]=='?'?'a':a[i];
            char c2 = b[i]=='?'?'a':b[i];
            if(c1<c2) return -1;
            if(c1>c2) return 1;
        }
        return 0;
    }
    private static boolean diffCheck(char[] a, char[] b, int as){
        for(int i=0;i<b.length;i++){
            if(a[i+as] != b[i]){
                if(a[i+as] != '?'){
                    return false;
                }
            }
        }
        return true;
    }
}