Halloween in ASCII (part 1)

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/ |###
###\          /###
####`--------`####
##################

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

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

Given the shuffled version, obtain the secret token.

Input

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

Each test case consists of a rectangular board of characters representing the shuffled picture, followed by a line containing =====.

The picture will contain only printable ASCII characters (ASCII codes 32-126). It 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
#|,  .-.  .-.  ,|#
####`--------`####
#(_     ^^     _)#
##/            \##
$##.-"  "  "'-.#$#
##################
#|/     /\     \|#
#| )(_o/  \o_)( |#
###| \IIIIII/ |###
##>09044444444<###
###\          /###
##################
##\__|IIIIII|__/##
=====

Output

Case #1: 09044444444