Equation
Programmer Vova has a keen interest in string-related problems. In this task, we define a string as any sequence of ASCII characters with codes ranging from 33 to 126.
Recently, Vova learned about two string operations:
**String addition**, represented by the symbol "+". For example, Doctor+Who=DoctorWho.
**String multiplication**, represented by the symbol "*". If S=A*B, then S=a_1+B+a_2+B+...+a_n+B, where a_i is the i-th character of string A (character indexing starts from 1). For instance, aca*x=axcxax.
Inspired by these operations, Vova decided to create equations where the unknown is a string. He then began solving these self-made equations.
Let's define this formally. An equation is a sequence a_1°a_2°...°a_n=b, where a_i can be an unknown string (denoted by "?"), or a specific non-empty string (written directly without any additional symbols or delimiters). b is a specific non-empty string. The symbols ° can be either addition or multiplication signs, and different operations can appear in different positions. All operations are executed strictly from left to right, and parentheses do not alter the order of operations. It is guaranteed that there exists at least one i such that a_i="?". The symbols "?", "+", "*", "=" are not used as characters in known strings. Additionally, all a_i and b are non-empty strings.
Your task is to solve such an equation, given that there is a non-empty solution.
Input
The first line contains the string S, which represents the equation. The number of operations does not exceed 200000, and the length of the string S is no more than 300000 characters. The equation always contains at least one "?" symbol.
Output
Output the value of the unknown string.