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.

Examples

Input

?tc????
coder


Output

atcoder


Input

??p??d??
abc


Output

UNRESTORABLE
import java.util.*;
import static java.lang.System.*;

class Main {
  public static final int MOD = 1000000007;
  public static final int INF = 1000000000;
  public static void main(String[] args) {
    Scanner sc = new Scanner(in);
    String S = sc.next();
    String T = sc.next();
    char[] S2 = S.toCharArray();
    char[] T2 = T.toCharArray();
    boolean check2 = false;
    for(int i=S2.length-1; i>=0; i--){
      int k = i;
      int j = T2.length-1;
      boolean check = false;
      if(check2 == true){
        if(S2[i] == '?') S2[i] = 'a';
        continue;
      }
      while(j >= 0 && k >= 0 && (S2[k] == T2[j] || S2[k] == '?')){
        if(j == 0){
          check = true;
          check2 = true;
          j = T2.length-1;
          while(j >= 0){
            S2[i] = T2[j];
            j--;
            i--;
          }
          i++;
        }
        j--;
        k--;
      }
      if(check == false){
        if(S2[i] == '?') S2[i] = 'a';
      }
    }
    if(check2 == true) out.println(S2);
    else out.println("UNRESTORABLE");
    
      
       
  }

  public static int gcd(int a, int b){
    if(b == 0) return a;
    return gcd(b, a%b);
  }
}