Codeforces Round 944 (Div. 4) |
---|

Finished |

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

implementation

sortings

*800

No tag edit access

The problem statement has recently been changed. View the changes.

×
A. My First Sorting Problem

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputYou are given two integers $$$x$$$ and $$$y$$$.

Output two integers: the minimum of $$$x$$$ and $$$y$$$, followed by the maximum of $$$x$$$ and $$$y$$$.

Input

The first line contains a single integer $$$t$$$ ($$$1 \leq t \leq 100$$$) — the number of test cases.

The only line of each test case contains two space-separated integers $$$x$$$ and $$$y$$$ ($$$0 \leq x, y \leq 9$$$).

Output

For each test case, output two integers: the minimum of $$$x$$$ and $$$y$$$, followed by the maximum of $$$x$$$ and $$$y$$$.

Example

Input

101 98 41 43 42 02 46 93 30 09 9

Output

1 9 4 8 1 4 3 4 0 2 2 4 6 9 3 3 0 0 9 9

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/13/2024 04:59:47 (j2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|