#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <iterator>
#include <bitset>
#include <complex>
#include <fstream>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T> T RoundOff(T a){ return int(a+.5-(a<0)); }
template<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }
template<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }
template<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }

int INF = 1 << 20;

struct P
{
	int d;
	string root;
	
	P() : d(INF), root("") {}
	P(int d, string root) : d(d), root(root) {}
};

string toString(int x)
{
	stringstream ss; ss << x;
	return ss.str();
}

int main()
{
	P G[10][10];
	
	rep(i, 10) rep(j, 10) if(j - i == 1 || (i <= 5 && j <= 5 && i - j == 1) || (i == 9 && j == 5))
		G[i][j] = P(1, toString(i) + toString(j));
	
	rep(k, 10) rep(i, 10) rep(j, 10) if(G[i][j].d > G[i][k].d + G[k][j].d)
		G[i][j] = P(G[i][k].d + G[k][j].d, G[i][k].root + G[k][j].root.substr(1));
	
	int n;
	cin >> n;
	
	while(n--)
	{
		int f, t;
		cin >> f >> t;
		
		string ans = G[f][t].root;
		
		rep(i, ans.size())
			cout << ans[i] << (i == ans.size() - 1 ? "\n" : " ");
	}
}