#include <stdio.h>
#include <string.h>
#include <stdlib.h>const int MAXD = 60;
typedef struct Node
{int x, y;
}E;
E e[MAXD];
int A, B;int cmp(const void *_p, const void *_q)
{E *p = (E *)_p;E *q = (E *)_q;return p -> y - q -> y;
}int main()
{int n;scanf("%d", &n);while(n --){scanf("%d%d", &A, &B);int k = 0;for(int i = A; i <= B; i ++){e[k].x = i;char str[20];int t = i, m = 0;while(t){str[m ++] = t % 10 + '0';t /= 10;}str[m] = '\0';//printf("%s\n", str);int s = 1, j;e[k].y = 0;for(j = strlen(str) - 1; j >= 10; )if(str[j] == '0') j --;for(; j >= 0 ; j --){e[k].y += (str[j] - '0') * s;s *= 10;}//printf("%d\n", e[k].y);k ++;}qsort(e, k, sizeof e[0], cmp);k --;for(int i = 0; i < k; i ++){printf("%d ", e[i].x);}printf("%d\n", e[k].x);}return 0;
}

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <iostream>
using namespace std;const int base = 10000;
const int width = 4;
const int N = 1000;
struct bint
{int ln, v[N];bint (int r = 0){for(ln = 0; r > 0; r /= base) v[ln ++] = r % base;}bint & operator = (const bint& r){memcpy(this, &r, (r.ln + 1) * sizeof (int));return *this;}
};/*
bool operator <(const bint& a, const bint& b)
{int i;if(a.ln != b.ln) return a.ln < b.ln;for(i = a.ln - 1; i >= 0 && a.v[i] == b.v[i]; i --){return i < 0 ? 0 : a.v[i] < b.v[i];}
}
*/bint operator * (const bint& a, const bint& b)
{bint res;res.ln = 0;if(0 == b.ln) {res.v[0] = 0; return res;}int i, j, cy;for(i = 0; i < a.ln; i ++){for(j = cy = 0; j < b.ln || cy > 0; j ++, cy /= base){if(j < b.ln) cy += a.v[i] * b.v[j];if(i + j < res.ln) cy += res.v[i + j];if(i + j >= res.ln) res.v[res.ln ++] = cy % base;else res.v[i + j] = cy % base;}}
}bool read(bint& b, char buf[])
{//if(1 != scanf("%s", buf)) return 0;int w, u, ln = strlen(buf);memset(&b, 0, sizeof(bint));if('0' == buf[0] && 0 == buf[1]) return 1;for(w = 1, u = 0; ln; ){u += (buf[-- ln] - '0') * w;if(w * 10 == base){b.v[b.ln ++] = u, u = 0, w = 1;}else w *= 10;}if(w != 1) b.v[b.ln ++] = u;return 1;
}void write(const bint& v)
{int i;printf("%d", v.ln == 0 ? 0 : v.v[v.ln - 1]);for(i = v.ln - 2; i >= 0; i --)printf("%04d", v.v[i]);printf("\n");
}int n, t;
bint s, v, u;int main()
{scanf("%d", &n);while(n --){scanf("%d", &t);int k = t / 3;char str1[10] = "1", str2[10] = "2", str3[10] = "3";read(s, str1);read(v, str2);read(u, str3);//write(s);//write(v);//write(u);for(int i = 0; i < k - 1; i ++){s = s * u;}if(t % 3 == 1){s = s * v;s = s * v;}else if(t % 3 == 2){s = s * u;s = s * v;}else{s = s * u;}write(s);}return 0;
}

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
int a[15];
int x, y;
int cnt, ans;
int id(int x)
{if(x < 0)return x + 100;elsereturn x % 100;
}int min(int a, int b)
{if(a == -1)return b;elsereturn a < b ? a : b;
}int to(int x)
{x = id(x);if(x / 10 == 0){return a[x];}int tx = x / 10, bx = x % 10;if(a[10] && a[tx] && a[bx])return 3;return 0;
}int main()
{//freopen("543.in", "r", stdin);//freopen("D.out", "w", stdout);int t;scanf("%d", &t);while(t --){ans = -1;scanf("%d%d%d%d", &a[1], &a[2], &a[3], &a[11]);scanf("%d%d%d%d", &a[4], &a[5], &a[6], &a[12]);scanf("%d%d%d", &a[7], &a[8], &a[9]);scanf("%d%d", &a[10], &a[0]);scanf("%d%d", &x, &y);//枚举步数for(int i = 0; i < 100; i ++){if(a[11]){if(id(y - i) == x) //向上按i次ans = min(ans, i);else if(to(y - i)) //可以到一个频道 + 向上i次ans = min(ans, to(y - i) + i);}if(a[12]){if(id(y + i) == x)//向下按i次
                {ans = min(ans, i);}else if(to(y + i))//到一个频道 + 向下i次ans = min(ans, to(y + i) + i);}}printf("%d\n", ans);}return 0;
}

#include <stdio.h>
#include <string.h>
#include <stdlib.h>const int MAXN = 35;
int a[MAXN][MAXN];
int n;int judge()
{for(int i = 0; i < n; i ++){for(int j = 0; j < n; j ++){if(a[i][i] != 0)return 1;}}for(int i = 0; i < n; i ++){for(int j = 0; j < n; j ++){if(i == j) continue;if(a[i][j] <= 0)return 2;}}for(int i = 0; i < n; i ++){for(int j = 0; j < n; j ++){if(a[i][j] != a[j][i])return 3;}}for(int i = 0; i < n; i ++){for(int j = 0; j < n; j ++){for(int k = 0; k < n; k ++){if(i == j || j == k || i == k) continue;if(a[i][j] + a[j][k] < a[i][k])return 4;}}}return 0;
}int main()
{int t;scanf("%d", &t);while(t --){scanf("%d", &n);for(int i = 0; i < n; i ++)for(int j = 0; j < n; j ++)scanf("%d", &a[i][j]);printf("%d\n", judge());}return 0;
}

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <algorithm>
using namespace std;
const int MAXN = 100005;
int a[15], f[MAXN], V;void ZeroOnePack(int F[], int C, int W)
{for(int v = V; v >= C; v --)F[v] = max(F[v], F[v - C] + W);
}void CompletePack(int F[], int C, int W)
{for(int v = C; v <= V; v ++)F[v] = max(F[v], F[v - C] + W);
}void MultiplePack(int F[], int C, int W, int M)
{if(C * M >= V){CompletePack(F, C, W);return;}int k = 1;while(k < M){ZeroOnePack(F, k * C, k * W);M -= k;k <<= 1;}ZeroOnePack(F, C * M, W * M);
}int main()
{int t = 0;while(true){int total = 0;for(int i = 1; i <= 10; i ++){scanf("%d", &a[i]);total += a[i] * i;}if(total == 0) break;++ t;if(total & 1)printf("#%d:Can't be divided.\n", t);else{int target = total >> 1;memset(f, 0, sizeof f);V = target;for(int i = 1; i <= 10; i ++){MultiplePack(f, i, i, a[i]);}if(f[target] == target){printf("#%d:Can be divided.\n", t);}elseprintf("#%d:Can't be divided.\n", t);printf("\n");}}return 0;
}