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 int mod = (int)(1e9 + 7);
vector<int> read(int n) {
  vector<int> v(n);
  for (int i = 0; i < n; i++) cin >> v[i];
  return v;
}
long long int test = 0;
void solve() {
  long long int i, j, k, m, n, ans = 0, cnt = 0, sum = 0;
  long long int x1, x2, x3, x4;
  cin >> x1 >> x2 >> x3 >> x4;
  vector<long long int> v = {x1, x2, x3, x4};
  sort(v.begin(), v.end());
  cout << v[3] - v[0] << " " << v[1] - (v[3] - v[0]) << " "
       << v[2] - (v[3] - v[0]);
  test++;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int i = 1;
  solve();
  return 0;
}