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 <algorithm>
#include <string>
using namespace std;
int main(void){
  int n,m,i,j;
  string sd,t,ans;
  cin >> sd >> t;
  n=sd.size();
  m=t.size();
  for (i=n-m;i>=0;i--){
    for (j=0;j<m;j++) if (sd[i+j]!='?' && sd[i+j]!=t[j]) break;
    if (j==m) break;
  }
  if (i==-1){
    cout << "UNRESTORABLE" << endl;
    return 0;
  }
  ans=sd;
  for (j=0;j<m;j++) ans[i+j]=t[j];
  for (j=0;j<n;j++){
    if (j>=i && j<i+m) continue;
    if (sd[j]=='?') ans[j]='a';
    else ans[j]=sd[j];
  }
  cout << ans << endl;
  return 0;
}