Problem: Polycarp has guessed three positive integers a, b and c. He keeps these numbers in secret, but he writes down four numbers on a board in arbitrary order — their pairwise sums (three numbers) and sum of all three numbers (one number). So, there are four numbers on a board in random order: a+b, a+c, b+c and a+b+c.

You have to guess three numbers a, b and c using given numbers. Print three guessed integers in any order.

Pay attention that some given numbers a, b and c can be equal (it is also possible that a=b=c).

Input

The only line of the input contains four positive integers x_1, x_2, x_3, x_4 (2 ≤ x_i ≤ 10^9) — numbers written on a board in random order. It is guaranteed that the answer exists for the given number x_1, x_2, x_3, x_4.

Output

Print such positive integers a, b and c that four numbers written on a board are values a+b, a+c, b+c and a+b+c written in some order. Print a, b and c in any order. If there are several answers, you can print any. It is guaranteed that the answer exists.

Examples

Input


3 6 5 4


Output


2 1 3


Input


40 40 40 60


Output


20 20 20


Input


201 101 101 200


Output


1 100 100

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
using bin = std::bitset<8>;
struct debugger {
  template <typename T>
  debugger& operator,(const T& v) {
    cerr << v << " ";
    return *this;
  }
} dbg;
bool check_key(map<int64_t, int64_t> m, int64_t key) {
  if (m.find(key) == m.end()) return false;
  return true;
}
vector<int64_t> SieveOfEratosthenes(int64_t n) {
  bool prime[n + 1];
  memset(prime, true, sizeof(prime));
  vector<int64_t> res;
  for (int64_t p = 2; p * p <= n; p++) {
    if (prime[p] == true) {
      for (int64_t i = p * p; i <= n; i += p) prime[i] = false;
    }
  }
  for (int64_t p = 2; p <= n; p++)
    if (prime[p]) res.push_back(p);
  return res;
}
bin decToBinary(int64_t n) {
  int64_t binaryNum[32];
  int64_t i = 0;
  while (n > 0) {
    binaryNum[i] = n % 2;
    n = n / 2;
    i++;
  }
  string x = "";
  for (int64_t j = i - 1; j >= 0; j--) {
    x += to_string(binaryNum[j]);
  }
  bin result{x};
  return result;
}
int64_t convertBinaryToDecimal(long long n) {
  int64_t decimalNumber = 0, i = 0, remainder;
  while (n != 0) {
    remainder = n % 10;
    n /= 10;
    decimalNumber += remainder * pow(2, i);
    ++i;
  }
  return decimalNumber;
}
int64_t factorial(int64_t n) {
  long long res = 1;
  for (int64_t i = 1; i <= n; i++) {
    res = ((res * i) % 1000000007 + 1000000007) % 1000000007;
  }
  return res;
}
int32_t main() {
  ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  int64_t nums[4];
  for (int64_t i = 0; i < 4; i++) {
    int64_t x;
    cin >> x;
    ;
    nums[i] = x;
  }
  sort(nums, nums + 4);
  cout << nums[3] - nums[0] << " " << nums[3] - nums[1] << " "
       << nums[3] - nums[2];
}