beecrowd | 1030
# Flavious Josephus Legend

**Timelimit: 1**

By Neilor Tonin, URI Brazil

The Josephus' problem is known because of the Flavius Josephus' legend, a Jewish historian living in the 1st century. According to Josephus' account of the siege of Yodfat, he and his 40 comrade soldiers were trapped in a cave, the exit of which one was blocked by Romans. They chose suicide over capture and decided that they would form a circle and start killing themselves skipping three in three. Josephus says that, by luck or maybe by the hand of God, he remained the last and gave up to the Romans.”

There are **NC **(1 ≤ **NC **≤ 30 ) test cases.
In each input test case there will be a pair of positive integer numbers **n **(1 ≤ **n **≤ 10000 ) and **k **(1 ≤ **k **≤ 1000). The number **n **represents the quantity of people in the circle, numbered from 1 to **n**. The number **k **represents the size of step between two men in the circle.

Follow an example with 5 men and step 2: In this example the remaining element is 3.

The data must be read from standard input.

For each test case we will have an output line, presenting in the following format:* Case n: m*

Output Sample | Input Sample |

3 |
Case 1: 3 |