For given three integers $a, b, c$, print the minimum value and the maximum value.

Constraints

* $-1,000,000,000 \leq a, b, c \leq 1,000,000,000$

Input

The input is given in the following format.


$a \; b \; c\;$


Three integers $a, b, c$ are given in a line.

Output

Print the minimum and maximum values separated by a space in a line.

Example

Input

4 5 3


Output

3 5
#include<bits/stdc++.h>
using namespace std;

bool cmp(long long & a, long long & b)
{
	return a < b;
}

int main(void)
{
	long long res[3];
	for (int i = 0; i < 3; i++)
		cin >> res[i];
	sort(res, res + 3, cmp);
	cout << res[0] << " " << res[2] << endl;
	return 0;
}
