Codeforces Round 347 (Div. 2)
B
Rebus
Codeforces
未评级
原题
← AC →
翻译中…

You are given a rebus of form ? + ? - ? + ? = n, consisting of only question marks, separated by arithmetic operation '+' and '-', equality and positive integer $*n*$. The goal is to replace each question mark with some positive integer from $1$ to $*n*$, such that equality holds.

翻译中…

Input

翻译中…

The only line of the input contains a rebus. It's guaranteed that it contains no more than $100$ question marks, integer $*n*$ is positive and doesn't exceed $1 000 000$, all letters and integers are separated by spaces, arithmetic operations are located only between question marks.

翻译中…

Output

翻译中…

The first line of the output should contain "Possible" (without quotes) if rebus has a solution and "Impossible" (without quotes) otherwise.

翻译中…

If the answer exists, the second line should contain any valid rebus with question marks replaced by integers from $1$ to $*n*$. Follow the format given in the samples.

翻译中…

样例

Input #1
? + ? - ? + ? + ? = 42
Output #1
Possible
9 + 13 - 39 + 28 + 31 = 42
InputCopy OutputCopy
Input #2
? - ? = 1
Output #2
Impossible
InputCopy OutputCopy
Input #3
? = 1000000
Output #3
Possible
1000000 = 1000000
InputCopy OutputCopy
题目信息
题号
664B
时间限制
1 s
内存限制
256 MB

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。