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 <iostream>
#include <fstream>
#include <queue>
#include <list>
//#define LOCAL
using namespace std;
typedef long long ll;
const int mx=1e3+10;
priority_queue<ll, vector<ll>, greater<ll> >num1;
priority_queue<ll, vector<ll>, less<ll> >num2;
int main() {
#ifdef LOCAL
ifstream fin("1.txt");
streambuf*p;
p=cin.rdbuf(fin.rdbuf());
#endif // LOCAL
for(int i=1;i<=3;i++){
    ll value;
    cin>>value;
    num1.push(value);
    num2.push(value);
}
printf("%lld %lld\n", num1.top(), num2.top());


#ifdef LOCAL
fin.close();
#endif // LOCAL
}


