{"problem":{"name":"Dubious Document 2","description":{"content":"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 ","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc076_c"},"statements":[{"statement_type":"Markdown","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`.\n\n## Constraints\n\n*   $1 \\leq |S'|, |T| \\leq 50$\n*   $S'$ consists of lowercase English letters and `?`.\n*   $T$ consists of lowercase English letters.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$S$\n$T'$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc076_c","tags":[],"sample_group":[["?tc????\ncoder","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`."],["??p??d??\nabc","UNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string $S$ does not exist."]],"created_at":"2026-03-03 11:01:14"}}