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
//与えられた3つの数字の最大最小を求める
#include<iostream>
#include<algorithm>
#include<vector>
#include<cassert>

int main (){
    std::vector<int> vec{};
    int a;
    
    for(int i=0;i<3;i++){
        std::cin>>a;
        vec.push_back(a);
    }

    auto t = std::minmax_element(vec.begin(),vec.end());//iteratorなので*をつけないと要素はわからない
    std::cout<<*t.first<<" "<<*t.second<<std::endl;

    return 0;
}

