#include <bits/stdc++.h>
int main() {
  int a, b, c, ara[12], ar[15], i, j, k, n = 4, temp, temp1, temp2;
  for (i = 0; i < n; i++) {
    scanf("%d", &ara[i]);
  }
  for (i = 0; i < n - 1; i++) {
    for (j = i + 1; j < n; j++) {
      if (ara[i] < ara[j]) {
        temp = ara[i];
        ara[i] = ara[j];
        ara[j] = temp;
      }
    }
  }
  if (ara[0] == ara[1] == ara[2] == ara[3]) {
    k = ara[0] - ara[1];
    printf("%d %d %d", k, k, k);
  } else {
    int l = ara[0] - ara[3];
    int m = ara[0] - ara[2];
    int t = ara[0] - ara[1];
    printf("%d %d %d", l, m, t);
  }
  return 0;
}

### Prompt

Please create a solution in CPP to the following 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

### Response

```cpp
#include <bits/stdc++.h>
int main() {
  int a, b, c, ara[12], ar[15], i, j, k, n = 4, temp, temp1, temp2;
  for (i = 0; i < n; i++) {
    scanf("%d", &ara[i]);
  }
  for (i = 0; i < n - 1; i++) {
    for (j = i + 1; j < n; j++) {
      if (ara[i] < ara[j]) {
        temp = ara[i];
        ara[i] = ara[j];
        ara[j] = temp;
      }
    }
  }
  if (ara[0] == ara[1] == ara[2] == ara[3]) {
    k = ara[0] - ara[1];
    printf("%d %d %d", k, k, k);
  } else {
    int l = ara[0] - ara[3];
    int m = ara[0] - ara[2];
    int t = ara[0] - ara[1];
    printf("%d %d %d", l, m, t);
  }
  return 0;
}

```