{"raw_statement":[{"iden":"problem statement","content":"E869120 found a chest which is likely to contain treasure.  \nHowever, the chest is locked. In order to open it, he needs to enter a string $S$ consisting of lowercase English letters.  \nHe also found a string $S'$, which turns out to be the string $S$ with some of its letters (possibly all or none) replaced with `?`.\nOne more thing he found is a sheet of paper with the following facts written on it:\n\n*   Condition 1: The string $S$ contains a string $T$ as a contiguous substring.\n*   Condition 2: $S$ is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string $S$.  \nIf such a string does not exist, print `UNRESTORABLE`."},{"iden":"constraints","content":"*   $1 \\leq |S'|, |T| \\leq 50$\n*   $S'$ consists of lowercase English letters and `?`.\n*   $T$ consists of lowercase English letters."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$S$\n$T'$"},{"iden":"sample input 1","content":"?tc????\ncoder"},{"iden":"sample output 1","content":"atcoder\n\nThere are $26$ strings that satisfy Condition 1: `atcoder`, `btcoder`, `ctcoder`,..., `ztcoder`. Among them, the lexicographically smallest is `atcoder`, so we can say $S = $ `atcoder`."},{"iden":"sample input 2","content":"??p??d??\nabc"},{"iden":"sample output 2","content":"UNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string $S$ does not exist."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}