## Bubble Cup V9 E Festival organization

View as PDF

Points: 25
Time limit: 0.6s
Memory limit: 256M

Problem type
Allowed languages
Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, CommonLisp, D, Dart, F#, Forth, Fortran, Go, Groovy, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, Nim, ObjC, OCaml, Octave, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

The Prodiggers are quite a cool band and for this reason, they have been the surprise guest at the ENTER festival for the past years. At the beginning of their careers, they weren't so successful, so they had to spend time digging channels to earn money; hence the name.

Anyway, they like to tour a lot and have surprising amounts of energy to do extremely long tours. However, they hate spending two consecutive days without having a concert, so they would very much like to avoid it.

The Prodiggers would like to hold tours of length of at least days, and at most days. Since they are quite superstitious, they want all their tours to have the same length and different schedules (regarding playing concerts and skipping days). Additionally, they would absolutely hate to skip two consecutive days in a single tour. Since their schedule is quite busy, they want you to tell them in how many ways can they hold the tours, modulo .

#### Input Specification

The first and only line of input will contain numbers:

#### Output Specification

Output a single number: in how many ways can they hold the tours, modulo .

#### Example Input

1 1 2

#### Example Output

5