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 <cstring>
#include <vector>

using std::vector;

int main()
{
    long long n[3];
    long long max = -1000000000, min = 1000000000;
    std::cin>>n[0]>>n[1]>>n[2];
    //std::cout<<n[0]<<" "<<n[1]<<" "<<n[2]<<std::endl;

    for(int i = 0; i < 3; i++)
    {
        if(min>n[i])
        {
            //std::cout<<"flag1"<<std::endl;
            min=n[i];
        }
        if(max<n[i])
        {
            //std::cout<<"flag2"<<std::endl;
            max=n[i];
        }
    }
    std::cout<<min<<" "<<max<<std::endl;
    return 0;
}



