Under construction

Still being built. Things may change

Smallest number

Time limit5sMemory limit1024 MB

Summary
Given three digits, arrange them into the smallest three-digit number that does not start with a zero.
Level

Easy1 of 10

Topics
Sorting, Implementation
Solved
No attempts yet

Problem

Three digits XX, YY, and ZZ are given (they need not be distinct). Arrange them in a sequence to form the smallest possible three-digit number. The number cannot have a leading zero.

Input

The first and only line contains three non-negative integers XX, YY, and ZZ (0≤X,Y,Z≤90 \le X, Y, Z \le 9), at least one of which is positive.

Output

Print the smallest three-digit number (without leading zeros) that can be formed by arranging the digits from the input.

Examples2

  1. Example 1

    Input
    5 2 0
    
    Expected output
    205
    
  2. Example 2

    Input
    1 2 3
    
    Expected output
    123