#include <bits/stdc++.h>
using namespace std;
int main() {
  pair<int, int> a[3];
  int b[3][3];
  cin >> a[0].first >> a[1].first >> a[2].first;
  int i;
  for (i = 0; i <= 2; i++) a[i].second = i;
  sort(a, a + 3);
  for (i = 0; i <= a[2].first; i++) {
    if (i <= a[0].first && a[2].first - i <= a[1].first) {
      b[a[2].second][a[0].second] = b[a[0].second][a[2].second] = i;
      b[a[2].second][a[1].second] = b[a[1].second][a[2].second] =
          a[2].first - i;
      int p, q;
      p = a[0].first - i;
      q = a[1].first - (a[2].first - i);
      if (p == q) {
        b[a[0].second][a[1].second] = b[a[1].second][a[0].second] = p;
        cout << b[0][1] << " " << b[1][2] << " " << b[2][0] << endl;
        goto p1;
      }
    }
  }
  cout << "Impossible" << endl;
p1 : {}
  return 0;
}
