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<queue>
#include<iostream>
#include<algorithm>
#include<list>
using namespace std;
list<int>li[1000];
list<int>::iterator it;
int main() {
	long long a,b,c;
	scanf("%lld%lld%lld", &a, &b,&c);
	printf("%lld %lld\n", min(min(a, b), c), max(max(a, b), c));
	
}


