#include<stdio.h>
#include<math.h>
int opposite(int n)
{
if (n == 10)
return 1;
int m = (int)ceil(log10(n)), sum = 0;
for (int i = m - 1; i >= 0; i--)
{
sum = n % 10 * pow(10, i) + sum;
n = n / 10;
}
return sum;
}
int main()
{
int bottle, d;
scanf("%d", &d);
while (d--)
{
int a[50] = { 0 }, b[50] = { 0 }, m, n;
scanf("%d%d", &m, &n);
for (int i = m; i <= n; i++)
{
a[i] = i;
b[i] = opposite(i);
}
while (1)
{
int sum = 0;
for (int j = m + 1; j <= n; j++)
{
if (b[j] < b[j - 1])
{
bottle =a[j];
a[j] = a[j - 1];
a[j - 1] = bottle;
sum++;
bottle = b[j];
b[j] =b[j - 1];
b[j - 1] = bottle;
sum++;
}
//if(sum==0)
//break;
}
if (sum == 0)
break;
}
for (int j = m; j <= n; j++)
{
printf("%d ", a[j]);
}
printf("\n");
}
return 0;
}
oj平台运行错误50%