Long ago, the Fractal civilization created artwork consisting of linear
rows of tiles. They had two types of tile that they could use: gold
(G
) and lead (L
).
Each piece of Fractal artwork is based on two parameters: an original sequence of K tiles, and a complexity C. For a given original sequence, the artwork with complexity 1 is just that original sequence, and the artwork with complexity X+1 consists of the artwork with complexity X, transformed as follows:
L
tile in the complexity X artwork with
another copy of the original sequenceG
tile in the complexity X artwork with
K G
tiles
For example, for an original sequence of LGL
, the pieces of
artwork with complexity 1 through 3 are:
LGL
(which is just the original sequence)
LGLGGGLGL
LGLGGGLGLGGGGGGGGGLGLGGGLGL
Here's an illustration of how the artwork with complexity 2 is generated from the artwork with complexity 1:
You have just discovered a piece of Fractal artwork, but the tiles are too
dirty for you to tell what they are made of. Because you are an expert
archaeologist familiar with the local Fractal culture, you know the values of
K and C for the artwork, but you do not know the original
sequence. Since gold is exciting, you would like to know whether there is at
least one G
tile in the artwork. Your budget allows you to hire
S graduate students, each of whom can clean one tile of your choice (out
of the K^{C} tiles in the artwork) to see whether the
tile is G
or L
.
Is it possible for you to choose a set of no more than S specific tiles
to clean, such that no matter what the original pattern was, you will be
able to know for sure whether at least one G
tile is present in
the artwork? If so, which tiles should you clean?
The first line of the input gives the number of test cases, T. T test cases follow. Each consists of one line with three integers: K, C, and S.
For each test case, output one line containing Case #x: y
, where
x
is the test case number (starting from 1) and y
is
either IMPOSSIBLE
if no set of tiles will answer your question, or
a list of between 1 and S positive integers, which are the positions of
the tiles that will answer your question. The tile positions are numbered from
1 for the leftmost tile to K^{C} for the rightmost tile.
Your chosen positions may be in any order, but they must all be different.
If there are multiple valid sets of tiles, you may output any of them. Remember that once you submit a Small and it is accepted, you will not be able to download and submit another Small input. See the FAQ for a more thorough explanation. This reminder won't appear in problems in later rounds.
1 ≤ T ≤ 100.
1 ≤ K ≤ 100.
1 ≤ C ≤ 100.
K^{C} ≤ 10^{18}.
S = K.
1 ≤ S ≤ K.
Input |
Output |
5 2 3 2 1 1 1 2 1 1 2 1 2 3 2 3 |
Case #1: 2 Case #2: 1 Case #3: IMPOSSIBLE Case #4: 1 2 Case #5: 2 6 |
Note: for some of these sample cases, other valid solutions exist.
In sample case #1, there are four possible original sequences: GG
,
GL
, LG
, and LL
. They would produce the
following artwork, respectively:
GG
: GGGGGGGG
GL
: GGGGGGGL
LG
: LGGGGGGG
LL
: LLLLLLLL
One valid solution is to just look at tile #2. If tile #2 turns out to be
G
, then you will know for sure the artwork contains at least one
G
. (You will not know whether the original sequence is
GG
, GL
, or LG
, but that doesn't matter.)
If tile #2 turns out to be L
, then you will know that the original
sequence must be LL
, so there are no G
s in the
artwork. So 2
is a valid solution.
On the other hand, it would not be valid to just look at tile #1. If it turns
out to be L
, you will only know that the original sequence could
have been either LG
or LL
. If the original sequence
is LG
, there is at least one G
in the artwork, but if
the original sequence is LL
, there are no G
s. So
1
would not be a valid solution.
Note that 1 2
is also a valid solution, because tile #2 already
provides all the information you need. 1 2 3
is not a valid
solution, because it uses too many tiles.
In sample case #2, the artwork must consist of only one tile: either
G
or L
. Looking at that tile will trivially tell you
whether or not the artwork has a G
in it.
In sample case #3, which would not appear in the Small dataset, the artwork
must be either GG
, GL
, LG
, or
LL
. You can only look at one tile, and neither of them on its own
is enough to answer the question. If you see L
for tile #1, you
will not know whether the artwork is LG
or LL
, so you
will not know whether any G
s are present. If you see
L
for tile #2, you will not know whether the artwork is
GL
or LL
, so you will not know whether any
G
s are present.
Sample case #4 is like sample case #3, but with access to one more tile. Now you can just look at the entire artwork.
In sample case #5, there are eight possible original sequences, and they would produce the following artwork:
GGG
: GGGGGGGGG
GGL
: GGGGGGGGL
GLG
: GGGGLGGGG
GLL
: GGGGLLGLL
LGG
: LGGGGGGGG
LGL
: LGLGGGLGL
LLG
: LLGLLGGGG
LLL
: LLLLLLLLL
One valid solution is to look at tiles #2 and #6. If they both turn out to
be L
s, the artwork must be all L
s. Otherwise, there
must at least one G
. Note that 1 2
would not be a
valid solution, because even if those tiles both turn out to be L
s,
that does not rule out an original sequence of LLG
.
6 2
would be a valid solution, since the order of the positions
in your solution does not matter.