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 Pascal (FPC 2.6.2) (judge verdict: Accepted)

var ans,s,ss,t:string;
    lent,lens:longint;
    i,j:longint;
    x:boolean;
    max:longint;
begin
  readln(s);
  readln(t);
  lens:=length(s);
  lent:=length(t);
  for i:=1 to lens do
  ans:=ans+'z';
  for i:=1 to lens-lent+1 do
  begin
    x:=true;
    for j:=1 to lent do
    if (s[i+j-1]<>t[j])and(s[i+j-1]<>'?') then
    begin
      x:=false;
      break;
    end;
    if x then
    begin
      ss:='';
      for j:=1 to i-1 do
      if s[j]='?' then ss:=ss+'a' else ss:=ss+s[j];
      ss:=ss+t;
      for j:=i+lent to lens do
      if s[j]='?' then ss:=ss+'a' else ss:=ss+s[j];
      if ss<ans then ans:=ss;
      max:=1;
    end;
  end;
  if max=0 then
  begin
    writeln('UNRESTORABLE');
    exit;
  end;
  writeln(ans);
end.