## Day 1, Problem 1 - Rabbit Farming

Farmer DongDong's crop yield has been sluggish all year long. Just when he's stressing over how to make some more money, he overheard the kids next door discussing the issue of rabbit breeding.

The question is this: A pair of little bunnies were just born at the start of the first month. After growing up in two months, these rabbits will give birth to two new little bunnies every month starting at the start of the third month. The newborn bunnies, after two months of growing up, will themselves give birth to a pair of bunnies every month afterwards. So the kids ask, how many total pairs of rabbits will there be in the nth month?

Being so clever, you've probably already discovered that the number of pairs of rabbits in month n just happens to be the nth Fibonacci number. DongDong doesn't know what a Fibonacci number is, but he did notice the rule: the pairs of rabbits in month i + 2 is equal to the pairs of rabbits in month i plus the pairs of rabbits in month i + 1. Thus, the pairs of rabbits in the first few months are: 1, 1, 2, 3, 5, 8, 13, 21, 34, …

DongDong noticed that the further he goes, the faster the number of rabbits grow. Looking forward to making big bucks breeding rabbits, DongDong immediately went out and bought a pair of bunnies at the start of the first month.

Each day, DongDong will feed the rabbits. Rabbits are very particular about their feeding habits. There will always be k pairs of rabbits surrounded in a circle. The remaining group which falls short of k pairs will form a circle, for rabbits are very scared of loneliness. Starting from the third month, if there exists a circle during feeding which consists of only a single pair of rabbits, then this pair will quickly die off.

Assuming that the rabbits who die are always the newest born, then the number of rabbits can still be calculated. For instance, when k = 7, the number of pairs of rabbits in the first few months will be: 1, 1, 2, 3, 5, 7, 12, 19, 31, 49, 80, …

Given n, can you help DongDong calculate how many pairs of rabbits there will be in month n? Since the answer can be very large, you are only required to report this number modulo p.

### Input Format

A single line containing three positive integers n, k, and p.

### Output Format

Output a single line containing a single integer, representing the number of pairs of rabbits in month n, modulo p.

### Sample Input 1

```6 7 100
```

```7
```

```7 7 5
```

```2
```

### Constraints

The attributes of all the test cases are outlined below.

Test CaseRange of nRange of k and p
11 ≤ n ≤ 502 ≤ k, p ≤ 1000
2
3
4
5
6
7
8
9
10
111 ≤ n ≤ 80 2 ≤ k, p ≤ 10,000
121 ≤ n ≤ 1000 2 ≤ k, p ≤ 10,000
13
141 ≤ n ≤ 106 2 ≤ k, p ≤ 106
15
161 ≤ n ≤ 1018 2 ≤ k, p ≤ 1000
17
181 ≤ n ≤ 1018 2 ≤ k ≤ 106, 2 ≤ p ≤ 109
19
20

Point Value: 20 (partial)
Time Limit: 1.00s
Memory Limit: 256M

Languages Allowed:
C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3

• (1/0)
Only two integers are present.

• (0/0)
Fixed. This was wrong in the official description too.