Time Limit: 1000MS Memory Limit: 65536 K

## Description

A magician does the following magic trick. He puts W white balls and B black
balls in his hat and asks someone from the audience, say Bob, to remove pairs
of balls in whatever order Bob would desire. After removing a pair of balls,
Bob is asked to place a white ball back into the hat if they are the same color.
Otherwise he is asked to place a black ball into the hat.
When Bob is left with only one ball in the hat, he asks the magician what color
the last ball is. Needless to say, the magician can't see the order by which Bob
does the replacements.
The problem is that the magician, like most magicians, is old and sometimes
forgets how to do the trick. Being the kind person you are, you are going to
help the magician.
For each pair of numbers (W,B) you are asked to output one of the following:
"WHITE" - if the last ball in the hat will be white for sure.
"BLACK" - if the last ball in the hat will be black for sure.
"UNKNOWN" - if you can't be sure of the last ball's color.
## Input

The first line of the input file contains the number of cases, N. N test cases follow.
Each case contains W and B on a line separated by a space.
0 < N ¡Ü 1000
W + B > 0
0 ¡Ü W ¡Ü 10^9
0 ¡Ü B ¡Ü 10^9
## Output

For each input case, you should output:
Case #X: Y
where X is the number of the test case and Y is either "WHITE", "BLACK"
or "UNKNOWN" as explained above. (quotes for clarity)
## Sample Input

2
3 1
3 6
## Sample Output

Case #1: BLACK
Case #2: WHITE

## Source

GOOGLE CODE JAM