## COI '09 #2 Kolo

View as PDF

Points: 20 (partial)
Time limit: 0.6s
Memory limit: 32M

Problem type

During meetings of young mathematicians a frequent pastime is the Prime Number Circle. For this task, we refer to mathematicians in the circle with numbers to .

Before the game starts we first draw circles and one square on the pavement arranged in a big circle. The player numbered stands in the square. All other players stand in the circles, starting with the player in a counterclockwise fashion facing towards the middle of the big circle.

The game consists of rounds. In the -th round the person standing in the square jumps up, says "It's me!" and then swaps places with the person standing on his right side times, where is the -th prime. For example for and the following three rounds occur:

Write a program that will for given , and determine the neighbours of the player numbered at the end of the game.

#### Input Specification

The first and only line contains three integers , and . , the number of players, rounds and the selected player.

#### Scoring

Test data is divided into four groups each worth points, with the following constraints:

First group: .

Second group: .

Third group: .

Fourth group: .

#### Output Specification

The first and only line of output should contain two integers, the numbers on the right and left neighbours of the player numbered at the end of the game.

#### Sample Input 1

5 3 1

#### Sample Output 1

3 5

#### Sample Input 2

5 3 2

#### Sample Output 2

5 4

#### Sample Input 3

5 4 5

#### Sample Output 3

3 2