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

var s,t,m,s1,s2:ansistring;
var n,i,j,k,l,ans:longint;
var a,b:array[0..100] of ansistring;
{var r:boolean;
function min(a,b:ansistring):ansistring;
var i:longint;
var t:ansistring;
begin
  if length(a)>length(b) then begin t:=a;a:=b;b:=t;end;
  for i:=1 to length(a) do
    if ord(a[i])<ord(b[i]) then exit(a)
    else if ord(b[i])<ord(a[i]) then exit(b);
  exit(a);
end;}
function same(a,b:ansistring):boolean;
var i:longint;
begin
  for i:=1 to length(a) do if (a[i]<>b[i]) and (a[i]<>'?') then exit(false);
  exit(true);
end;
begin
  readln(s);readln(t);s1:='1';
  for i:=length(s)-length(t)+2 to length(s) do s1:=s1+s[i];
  for i:=length(s)-length(t)+1 downto 1 do
  begin
    s1:=s[i]+s1;delete(s1,length(s1),1);
    if same(s1,t) then
    begin
      //writeln(i,' ',s1);
      m:=s;k:=0;
      for j:=i-length(s1)+1 to i do begin inc(k);m[j]:=t[k];end;
      for j:=1 to length(m) do if m[j]='?' then m[j]:='a';
      writeln(m);exit;
    end;
  end;
  writeln('UNRESTORABLE');
end.