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 <algorithm>
#include<iostream>
#include<vector>
#include<deque>
#include<queue>
#include<list>
#include<stack>
#include<map>
#include<set>
#include<string>
#include <sstream>

#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<limits.h>

using namespace std;


int main(){
  long ii,jj,kk;
  vector<int> ret;
  int a[3];
  long long int min,max;

  cin >> a[0] >> a[1] >> a[2];

  min = 10e10;
  max = -10e10;

  for(ii=0;ii<3;ii++){
    if(min > a[ii]){
      min = a[ii];
    }
    if(max < a[ii]){
      max = a[ii];
    }
  }

  cout << min << " " << max << endl;
  return 0;
}

