#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
int main() {
  int a[3];
  cin >> a[0] >> a[1] >> a[2];
  int b[3];
  memset(b, -1, sizeof(b));
  int m[2] = {0, a[0]};
  for (int i = 1; i < 3; i++) {
    if (m[1] > a[i]) {
      m[0] = i;
      m[1] = a[i];
    }
  }
  bool flag = false;
  for (int i = 0; i <= m[1]; i++) {
    int x = a[(m[0] + 1) % 3] - i;
    int y = a[(m[0] + 2) % 3] + i - m[1];
    if (x >= 0 && x == y) {
      flag = true;
      b[m[0] % 3] = i;
      b[(m[0] + 1) % 3] = x;
      b[(m[0] + 2) % 3] = m[1] - i;
    }
  }
  if (b[0] == -1) {
    cout << "Impossible" << endl;
  } else {
    cout << b[0] << " " << b[1] << " " << b[2] << endl;
  }
  return 0;
}
