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 Perl (v5.18.2) (judge verdict: Accepted)

#!/usr/bin/env perl

use strict;
use warnings;
use Data::Dumper;

my $line = <>; chomp $line;
my @sd = split //, $line;
$line = <>; chomp $line;
my @t = split //, $line;

my ($n, $m) = (scalar @sd, scalar @t);

unless ($m <= $n) {
  print "UNRESTORABLE\n";
  exit;
}

my @results;
NEXT: for (my $i = 0; $i < $n - $m + 1; $i++) {
  for (my $j = 0; $j < $m; $j++) {
    unless ($sd[$i + $j] eq $t[$j] || $sd[$i + $j] eq '?') {
      next NEXT;
    }
  }
  my @cand;
  for (my $k = 0; $k < $i; $k++) {
    push @cand, 'a' if $sd[$k] eq '?';
    push @cand, $sd[$k] unless $sd[$k] eq '?';
  }
  for (my $k = 0; $k < $m; $k++) {
    push @cand, $t[$k];
  }
  for (my $k = $i + $m; $k < $n; $k++) {
    push @cand, 'a' if $sd[$k] eq '?';
    push @cand, $sd[$k] unless $sd[$k] eq '?';
  }
  push @results, join('', @cand);
}

unless (scalar @results) {
  print "UNRESTORABLE\n";
  exit;
}

@results = sort @results;
print $results[0], "\n";