Codeforces Round #347 (Div. 2)-B. Rebus（模拟）

B. Rebus

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Examples

input

? + ? - ? + ? + ? = 42

output

Possible
9 + 13 - 39 + 28 + 31 = 42

input

? - ? = 1

output

Impossible

input

? = 1000000

output

Possible
1000000 = 1000000

思路：

  这道模拟题非常恶心，不过只要明白+与-的差之后就会明白，就是要将这个差转化为ans，所以接下来的就是简单的模拟实现了，这题主要是考思维吧。

AC代码：

#include<iostream>
#include<functional>
#include<algorithm>
#include<cstring>
#include<string>
#include<vector>
#include<cstdio>
#include<cmath>
#include<map>
using namespace std;
#define CRL(a) memset(a,0,sizeof(a))
#define QWQ ios::sync_with_stdio(0)
typedef unsigned __int64 LL;
typedef  __int64 ll;
const int T = 100000+50;
const int mod = 1000000007;

int v[1000+50],a[1000+50];

int main()
{
#ifdef zsc
	freopen("input.txt","r",stdin);
#endif

	int n,m,i,j,k,c,sa,sb,p;
	char s[2];
	scanf("%s",s);
	v[1] = sa = 1;
	sb = 0;
	c = 2;
	scanf("%s",s);
	while(s[0]!='=')
	{
		if(s[0]=='+'){
			v[c++] = 1;sa++;
		}
		else {
			v[c++] = -1,sb++;
		}
		scanf("%s",s);
		scanf("%s",s);
	}
	scanf("%d",&k);
	p = sa - sb;
	for(i=0;i<1000+50;++i)a[i]=1;
	for(i=1;i<c;++i){
		//如果p<k说明需要加号的数要更大
		while(p<k&&(a[i]<k)&&(v[i]==1))a[i]++,p++;
		//否则p要减少
		while(p>k&&(a[i]<k)&&(v[i]==-1))a[i]++,p--;
	}
	if(p!=k){
		printf("Impossible\n");
		return 0;
	}
	printf("Possible\n");
	printf("%d ",a[1]);
	for(i=2;i<c;++i){
		if(v[i]>0)printf("+ %d ",a[i]);
		else printf("- %d ",a[i]);
	}
	printf("= %d\n",k);
	return 0;
}