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 = 1e6 + 7, mod = 1000000007;
long long int a[N], b[N], cnt, sum, mx;
vector<pair<pair<long long int, long long int>, long long int> > v;
priority_queue<string> pq;
long long int kk;
stack<string> st;
long long int vis[N];
map<long long int, long long int> mp;
int main() {
  ios_base ::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int z = 0, n, m = 0, mn = 0, mx = 0, i = 0, x = mod, y = 0, k = 0,
                j = 0, xx, yy;
  string s;
  cin >> a[0] >> a[1] >> a[2] >> a[3];
  sort(a, a + 4);
  x = a[3] - a[0];
  y = a[3] - a[1];
  z = a[3] - a[2];
  cout << x << " " << y << " " << z;
}