#include <bits/stdc++.h>
using namespace std;
int main() {
  vector<pair<long, long> > a(3), b(3);
  long x, y, z;
  for (int i = 0; i < int(3); i++) {
    cin >> a[i].first;
    b[i].first = a[i].first;
  }
  sort(a.begin(), a.end());
  bool ok = false;
  for (int i = 0; i < int(a[2].first); i++) {
    x = a[2].first - i;
    y = i;
    z = a[1].first - x;
    if (a[1].first == x + z && a[0].first == y + z) {
      ok = true;
      break;
    }
  }
  if (!ok || x < 0 || y < 0 || z < 0) {
    cout << "Impossible";
    return 0;
  }
  vector<long> t(3);
  t[0] = x;
  t[1] = y;
  t[2] = z;
  sort(t.begin(), t.end());
  if (t[0] + t[1] == b[1].first && t[1] + t[2] == b[2].first &&
      t[0] + t[2] == b[0].first) {
    cout << t[0] << " " << t[1] << " " << t[2];
    return 0;
  }
  while (next_permutation(t.begin(), t.end())) {
    if (t[0] + t[1] == b[1].first && t[1] + t[2] == b[2].first &&
        t[0] + t[2] == b[0].first) {
      cout << t[0] << " " << t[1] << " " << t[2];
      break;
    }
  }
  return 0;
}
