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 C (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<stdio.h>
#include<string.h>

int main(){
  int i,j,k=100;
  char S[1000000],T[51];
  scanf("%s",S);
  scanf("%s",T);
  if(strlen(S)>=strlen(T)){
  for(i=0;i<=strlen(S)-strlen(T);i++){
    k=i;
      for(j=0;j<strlen(T);j++){
        if(S[i+j]!=T[j] &&S[i+j]!='?'){
          k=10000000;
          break;
        }
        if(j==strlen(T)-1){
          break;
        }
      }
    if(j==strlen(T)-1){
          break;
        }
  }
  }
  else
    k=10000000;
  if(k==10000000){
    puts("UNRESTORABLE");
    return 0;
  }
  for(i=k;i<k+strlen(T);i++)
    S[i]=T[i-k];
  for(i=0;i<strlen(S);i++){
    if(S[i]=='?')
      S[i]='a';
  }
  printf("%s\n",S);
  return 0;
}