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>
#define rep(i ,n) for(int i=0;i<(int)(n);++i)
using namespace std;
typedef long long int int64;
typedef unsigned long long uint64;

int main(){
    priority_queue<int,vector<int>,greater<int>> a;
    int l , m , n;
    cin >> l >> m >> n;
    a.push(l);
    a.push(m);
    a.push(n);
    cout << a.top() << " ";
    a.pop();
    a.pop();
    cout << a.top() << endl;
    return 0;
}
