//Code by hhy
#include<bits/stdc++.h>
#define F(i , a , b , c) for( int i = (a) ; ((c > 0) ? i <= (b) : i >= (b)) ; i += c )
#define T(i , root , b , c) for( int i = root ; b ; c )
#define int long long
#define W(f) while(f)
#define ull unsigned long long
#define pb push_back
#define fi first
#define se second
#define ll long long
using namespace std ;
const int kMaxN = 100 + 5 , MOD = 998244353 , INF = 1e18 ;
struct Edgepr
{
	int u , w ;
};
struct Edgeve
{
	int v , w ;
};
struct node
{
  int x , y , id ;
}Node[kMaxN] ;
int n ;
int f[kMaxN][kMaxN] ;
inline ll ksm(ll a , ll b)
{
	ll mul = 1 ;
	while(b)
	{
		if(b & 1) mul *= a , mul %= MOD ;
		a *= a ;
		a %= MOD ;
		b >>= 1 ;
	}
	return mul ;
}
void work()
{
	int T = 0 ;
  while(cin >> n)
  {
    // 初始化
  	memset(f , 0x3f , sizeof f) ;
		for( int i = 1 ; i <= 20 ; i++ ) f[i][i] = 0 ;
  	for( int i = 1 ; i <= 19 ; i++ )
  	{
  		for( int j = 1 ; j <= n ; j++ )
  		{
  			int x ;
  			cin >> x ;
  			f[i][x] = f[x][i] = 1 ; // 记录答案
			}
			cin >> n ;
		}
		printf("Test Set #%d\n" , ++T) ;
		for( int k = 1 ; k <= 20 ; k++ ) for( int i = 1 ; i <= 20 ; i++ ) for( int j = 1 ; j <= 20 ; j++ ) f[i][j] = min(f[i][j] , f[i][k] + f[k][j]) ; // 松弛
		while(n--)
		{
			int u , v ;
			cin >> u >> v ;
			printf("%2d to %2d: %d\n" , u , v , f[u][v]) ; // 注意
		}
    putchar('\n') ; // 注意
	}
}
signed main()
{
//	freopen(".in" , "r" , stdin) ;
//	freopen(".out" , "w" , stdout) ;
//	ios::sync_with_stdio(0) , cin.tie(0) , cout.tie(0) ;
  int t = 1 ;
  // cin >> t ;
  while(t--) work() ;
  return 0 ;
}