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: Accepted)

#include<stdio.h>

int main(){
  char sd[100] = {};int sdcnt = 0;
  char t[100] = {};int tcnt = 0;
  int i = 0;
  int j = 0;
  int success = 0;
  int li = 0;
  int ok = 0;
  scanf(" %s",sd);
  scanf(" %s",t);
  for(i=0;i < 100;i++){
    if(sd[i] == '\0'){
      sdcnt = i;
      break;
    }
  }
  for(i=0;i < 100;i++){
    if(t[i] == '\0'){
      tcnt = i;
      break;
    }
  }
  if(tcnt > sdcnt){
    success = 0;
  }else{
    for(i=0;i<=sdcnt-tcnt;i++){
      ok=1;
      for(j=0;j<tcnt;j++){
        //printf("%c %c\n",sd[i+j],t[j]);
        if(sd[i+j] != t[j] && sd[i+j] != '?'){
          ok=0;
        }
      }
      if(ok){
        success = 1;
        li = i;
        //printf("#");
      }
    }
  }
  if(success){
    for(i=0;i<tcnt;i++){
      sd[i+li] = t[i];
    }
    for(i=0;i<sdcnt;i++){
      if(sd[i] == '?'){
        sd[i] = 'a';
      }
    }
    printf("%s",sd);
  }else{
    printf("UNRESTORABLE");
  }

  return 0;
}