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<cstdio>
#include<algorithm>
#include<functional>
using namespace std;
int main(void)
{
	int a,b,c,mn,mx;
	scanf("%d %d %d",&a,&b,&c);
	mn=a;	mx=a;
	mn=min(mn,b);
	mx=max(mx,b);
	mn=min(mn,c);
	mx=max(mx,c);
	printf("%d %d\n",mn,mx);
	return 0;
}
