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
//1_  minmax表記
//pair型のmin_max関数：firstが最小値, secondが最大値
#include <iostream>
#include <algorithm>
using ll = long long;

int main()
{
    //std::pair<最小値の変数型 , 最大値の変数型> 変数名 = std::minmax(代入する値);
    //autoで宣言したほうが楽
    ll a, b, c;
    std::cin >> a >> b >> c;
    
    std::pair<int,int> abc = std::minmax({a,b,c});
    std::cout << abc.first << " " << abc.second << std::endl;

    return 0;
}
