Halloween in ASCII (part 2)

We have an ASCII picture of something often associated with Halloween. On the top line, we inserted a secret token stored between >< characters. Here is an example where the picture is of a skull, and the secret token is 09044444444:

##>09044444444<###
##################
$##.-"  "  "'-.#$#
##/            \##
#|,  .-.  .-.  ,|#
#| )(_o/  \o_)( |#
#|/     /\     \|#
#(_     ^^     _)#
##\__|IIIIII|__/##
###| \IIIIII/ |###
###\          /###
####`--------`####
##################

We'll call a view of this picture from row $L$ to row $R$ (inclusive, 0-based) a glimpse. For example, for $L = 2, R = 5$ , here is a glimpse of the above picture:

$##.-"  "  "'-.#$#
##/            \##
#|,  .-.  .-.  ,|#
#| )(_o/  \o_)( |#

Now, we shuffled the columns in the original picture in a random order:

4<4444#4904#0##4>#
##################
 ."-" #'-" $.#$ ##
      \    # ## /#
-   - ,. ..| ##.,|
o( )o  _(_/|)##\ |
  /  \\    | ## /|
  ^  ^_    ) ## _(
I_I_II/|_|I#_##I\#
I|I II#/ \I#|##I##
 /    #    #\## ##
-#-`--#-`--####-##
##################

You are given the shuffled version, and a glimpse of the original picture. Reconstruct the original and obtain the secret token. The inputs will guarantee that only one original picture is compatible with the provided data.

Input

The first line contains an integer $T$ — the number of test cases.

Each test case begins with two integers $L, R$ . The next $R - L + 1$ lines contain the glimpse of the original picture from rows $L$ through $R$ .

Afterwards, there will be a line containing =====, followed by the shuffled picture, and another line containing =====.

The picture will contain only printable ASCII characters (ASCII codes 32-126). The top row will contain only one pair of ><. Inspect the input file for any other assumptions.

Output

For each test case $i$ , output a single line Case #i: token, where token is the secret token (the entire string between > and < characters).

Example

Input

1
2 5
$##.-"  "  "'-.#$#
##/            \##
#|,  .-.  .-.  ,|#
#| )(_o/  \o_)( |#
=====
4<4444#4904#0##4>#
##################
 ."-" #'-" $.#$ ##
      \    # ## /#
-   - ,. ..| ##.,|
o( )o  _(_/|)##\ |
  /  \\    | ## /|
  ^  ^_    ) ## _(
I_I_II/|_|I#_##I\#
I|I II#/ \I#|##I##
 /    #    #\## ##
-#-`--#-`--####-##
##################
=====

Output

Case #1: 09044444444