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;
const long long N = 100005, INF = 2000000000000000000;
long long power(long long a, long long b, long long p) {
  if (a == 0) return 0;
  long long res = 1;
  a %= p;
  while (b > 0) {
    if (b & 1) res = (res * a) % p;
    b >>= 1;
    a = (a * a) % p;
  }
  return res;
}
bool prime[N] = {true};
long long sum[N] = {0};
void pre() {
  memset(prime, true, sizeof(prime));
  for (long long i = 2; i <= N; i++) {
    if (prime[i]) {
      for (long long j = i * i; j <= N; j += i) {
        prime[j] = false;
      }
    }
  }
  for (long long i = 2; i < N; i++) {
    if (prime[i]) sum[i] += i;
    sum[i + 1] = sum[i];
  }
  return;
}
class yup {
 public:
  long long gcd(long long a, long long b) {
    if (a == 0) return b;
    return gcd(b % a, a);
  }
  long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
};
long long minCoins(long long coins[], long long m, long long V) {
  if (V == 0) return 0;
  long long res = INT_MAX;
  for (long long i = 0; i < m; i++) {
    if (coins[i] <= V) {
      long long sub_res = minCoins(coins, m, V - coins[i]);
      if (sub_res != INT_MAX && sub_res + 1 < res) res = sub_res + 1;
    }
  }
  return res;
}
long long powers(long long x, unsigned long long y) {
  if (y == 0)
    return 1;
  else if (y % 2 == 0)
    return powers(x, y / 2) * powers(x, y / 2);
  else
    return x * powers(x, y / 2) * powers(x, y / 2);
}
int32_t main() {
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long a[4];
  for (long long i = 0; i < 4; i++) {
    cin >> a[i];
  }
  sort(a, a + 4);
  cout << a[3] - a[0] << " " << a[3] - a[1] << " " << a[3] - a[2];
}