#include <bits/stdc++.h>
using namespace std;
char s[100];
int A[200], N, M, T;
int main() {
  int f = 1, a = 0, b = 0;
  A[M++] = 1;
  while (scanf("%s", s), s[0] != '=') {
    if (s[0] == '+')
      A[M++] = f = 1;
    else if (s[0] == '-')
      A[M++] = f = 0;
    else
      ++(f ? a : b);
  }
  scanf("%d", &N);
  T = N + (N + 1) * b - M;
  if ((T > (N - 1) * M) || (T < 0)) {
    printf("Impossible\n");
  } else {
    printf("Possible\n");
    for (int i = 0; i < M; ++i) {
      int cur;
      if (T >= N - 1) {
        cur = A[i] ? N : 1;
        T -= N - 1;
      } else {
        cur = A[i] ? T + 1 : N - T;
        T = 0;
      }
      if (i) printf(A[i] ? "+ " : "- ");
      printf("%d ", cur);
    }
    printf("= %d\n", N);
  }
  return 0;
}
