CF663A.Rebus

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.

你将得到一个形如 ? + ? - ? + ? = n 的谜题，其中仅包含问号，并由算术运算符 + 和 -、等号以及正整数 n 分隔。目标是将每个问号替换为从 1 到 n 的某个正整数，使得等式成立。

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.

输入仅包含一行，即一个谜题。保证该谜题中问号（?）的数量不超过 100 个，整数 $n$ 为正数且不超过 $1\,000\,000$，所有字母和整数均由空格分隔，算术运算符仅出现在问号之间。

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.

输出的第一行应包含“Possible”（不带引号），如果谜题有解；否则包含“Impossible”（不带引号）。

如果存在答案，则第二行应输出任意一个有效谜题，其中所有问号均被替换为 $1$ 到 $n$ 之间的整数。输出格式需与样例一致。