Equation

Programmer Vova has long been interested in various string problems. In this problem, we consider a string to be any sequence of ASCII characters with codes from $33$ to $126$.

Recently, Vova learned about string operations:

• Addition of strings, denoted by the symbol "$+$". For example, Doctor+Who=DoctorWho.

• Multiplication of strings, denoted by the symbol "$\ast$". If S=A*B, then S=a_1+B+a_2+B+\ldots+a_n+B, where a_i is the $i$-th character of string $A$ (the characters of the string are numbered starting from $1$). For example, aca*x=axcxax.

After that, Vova thought: why not come up with an equation in which the unknown is a string? He then began to solve the equations he invented.

Let us move to formal definitions. We will call an equation a sequence a_1°a_2°\ldots°a_n=b, where a_i is either an unknown string (denoted by "?"), or some specific non-empty string (written by the string's characters, without any additional symbols or delimiters), $b$ is a specific non-empty string, and the symbols "$°$" may be either the addition or multiplication operations (different operators may occur in different positions). All operations are performed strictly from left to right; parentheses do not affect the operation order. It is guaranteed that there exists $i$ such that a_i = "?". The symbols "?", "$+$", "$\ast$", and "$=$" are not used as characters in known strings. Additionally, all a_i and $b$ are non-empty strings.

It is required to solve such an equation, given that there is a non-empty solution.