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 <string>
#include <algorithm>
#include <set>
#include <cmath>
#include <vector>
#include <queue>

typedef long long ll;
const ll LL_MAX (1LL<<60);

#define rep(i,s,e) for(ll i=(s); i<(e); i++) 

using namespace std;

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    ll a, b, c;
    cin >> a >> b >> c;

    ll _min, _max;

    _min = min(a, b);
    _min = min(_min, c);

    _max = max(a, b);
    _max = max(_max, c);

    cout << _min << ' ' << _max << endl;

    return 0;
}

