Problem A
Ladice
Mirko has
Mirko stores the items in order from
-
If the drawer
is empty, he stores the item in that drawer. -
If the drawer
is empty, he stores the item in that drawer. -
Try to move the item from
to its other drawer; if that one’s filled too, try moving that item to its other drawer, and so on until you either succeed or get back to a previously seen drawer. In case of success, store the item in the drawer . In case of failure, continue to next rule. -
Try moving the item from
to its other drawer; if that one’s filled too, try moving that item to its other drawer, and so on until you either succeed or get back to a previously seen drawer. In case of success, store the item in the drawer . In case of failure, continue to next rule. -
Give up and throw away the item
.
For given pairs of drawers for each item, determine which items will be stored and which will be thrown away.
Input
The first line of input consists of two integers,
Each of the following
Output
For each item, respectively, output where it ends up. In case the item is stored successfully, output “LADICA” (without quotes, Croatian word for drawer). In case the item is thrown away, output “SMECE” (without quotes, Croatian word for trash).
Sample Input 1 | Sample Output 1 |
---|---|
5 3 1 2 1 3 1 2 1 3 1 2 |
LADICA LADICA LADICA SMECE SMECE |
Sample Input 2 | Sample Output 2 |
---|---|
9 10 1 2 3 4 5 6 7 8 9 10 2 3 1 5 8 2 7 9 |
LADICA LADICA LADICA LADICA LADICA LADICA LADICA LADICA LADICA |