#include <bits/stdc++.h>
using namespace std;
int T, t, n, m;
int L[210], R[210];
int num[210];
char s[210][10];
int main() {
  int i, j, k, ans, ret;
  m = 1;
  s[1][1] = '+';
  while (true) {
    m++;
    scanf("%s", s[m] + 1);
    scanf("%s", s[m] + 1);
    if (s[m][1] == '=') break;
  }
  m--;
  scanf("%d", &n);
  for (i = 1; i <= m; i++) {
    if (s[i][1] == '+') {
      L[i] = L[i - 1] + 1;
      R[i] = R[i - 1] + n;
    } else {
      L[i] = L[i - 1] - n;
      R[i] = R[i - 1] - 1;
    }
  }
  if (L[m] <= n && n <= R[m]) {
    printf("Possible\n");
    ans = n;
    for (i = m; i >= 1; i--) {
      for (k = 1; k <= n; k++) {
        if (s[i][1] == '+')
          ret = ans - k;
        else
          ret = ans + k;
        if (L[i - 1] <= ret && ret <= R[i - 1]) {
          ans = ret;
          num[i] = k;
          break;
        }
      }
    }
    printf("%d", num[1]);
    for (i = 2; i <= m; i++) printf(" %s %d", s[i] + 1, num[i]);
    printf(" = %d\n", n);
  } else
    printf("Impossible\n");
}
