#t235. 电影排序

电影排序

Movie Sorting

Problem Description

Little  J \,J\, is on winter break and plans to watch  3 \,3\, movies,  a,b,c \,a, b, c\,. He likes things to "get better and better", so he wants to save the good movies for later.

Given the ratings of the  3 \,3\, movies a,b,ca, b, c, sort them from low to high by rating and help Little  J \,J\, decide the viewing order.

Input Format

Input three integers  a,b,c \,a, b, c\, (0≤a,b,c≤1000 \le a, b, c \le 100), all distinct, representing the ratings of the three movies.

Output Format

Output the  3 \,3\, integers in ascending order, with a single space between every two of them.

Sample Input 1

80 75 90

Sample Output 1

75 80 90

Sample Input 2

90 80 75

Sample Output 2

75 80 90

Sample Input 3

75 90 80

Sample Output 3

75 80 90

Hint

  • Sorting three numbers from low to high — the same trick as the earlier "sort three digits" problem: compare pairs and swap.
  • The problem guarantees the three numbers are all distinct, so you don't need to handle equal cases.