A. My First Sorting Problem

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You 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≤t≤1001≤𝑡≤100) — the number of test cases.

The only line of each test case contains two space-separated integers x𝑥 and y𝑦 (0≤x,y≤90≤𝑥,𝑦≤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

Copy

10

1 9

8 4

1 4

3 4

2 0

2 4

6 9

3 3

0 0

9 9

output

Copy

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

8

解题说明：水题，两个数比大小，直接判断即可。

#include<stdio.h>

int main() 
{
	int t;
	scanf("%d", &t);
	while (t--) 
	{
		int a, b;
		scanf("%d %d", &a, &b);
		printf("%d %d\n", (a > b) ? (b) : (a), (a < b) ? (b) : (a));
	}
	return 0;
}