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
#include <iostream>
#include <string>
using namespace std;

int main(){
  string str, t;
  cin >> str >> t;

  for(int i = str.size()-1; i >= 0; i--){
    //if(str[i] == t[0] || str[i] == '?'){
    for(int j = 0; j < t.size(); j++){
      if(str[i-j] != t[t.size()-1-j] && str[i-j] != '?') {break;}
	if(j+1 == t.size()){
	  //cout << "in" << endl;
	  str.replace(i-j, t.size(), t);
	  for(int k = 0; k < str.size(); k++) if(str[k]=='?') str[k] = 'a';
	  cout << str << endl;
	  return 0;
	}
      }
      //}
  }
  cout << "UNRESTORABLE" << endl;
}

      
