#### Problem Statement

You are given a task to sort three integers in ascending order without using any built-in sorting functions or libraries. The goal is to implement a program that reads three integers from the input and rearranges them such that they are sorted in non-decreasing order.

#### Approach

To manually sort three integers, we can use a series of conditional checks and swaps. First, compare the first two integers and swap them if the first is greater than the second, ensuring the smaller value is in the first position. Next, compare the first integer with the third, and swap if necessary to place the smallest value in the first position. Finally, compare the second and third integers, swapping if the second is greater than the third, which ensures the integers are sorted in ascending order. This approach efficiently sorts the three integers using a minimal number of comparisons and swaps.

#### Complexity Analysis

**Time Complexity**: The time complexity of this solution is O(1) because the number of operations is constant, regardless of the values of the integers.**Space Complexity**: The space complexity is O(1) as no additional space is used besides the input variables and a few temporary variables during swapping.