Please subscribe to the official Codeforces channel in Telegram via the link https://t.me/codeforces_official.
×

The package for this problem was not updated by the problem writer or Codeforces administration after we've upgraded the judging servers. To adjust the time limit constraint, a solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then the value 800 ms will be displayed and used to determine the verdict.

Codeforces Round 196 (Div. 2) |
---|

Finished |

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

binary search

greedy

math

matrices

number theory

*1600

No tag edit access

The problem statement has recently been changed. View the changes.

×
C. Quiz

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputManao is taking part in a quiz. The quiz consists of *n* consecutive questions. A correct answer gives one point to the player. The game also has a counter of consecutive correct answers. When the player answers a question correctly, the number on this counter increases by 1. If the player answers a question incorrectly, the counter is reset, that is, the number on it reduces to 0. If after an answer the counter reaches the number *k*, then it is reset, and the player's score is doubled. Note that in this case, first 1 point is added to the player's score, and then the total score is doubled. At the beginning of the game, both the player's score and the counter of consecutive correct answers are set to zero.

Manao remembers that he has answered exactly *m* questions correctly. But he does not remember the order in which the questions came. He's trying to figure out what his minimum score may be. Help him and compute the remainder of the corresponding number after division by 1000000009 (10^{9} + 9).

Input

The single line contains three space-separated integers *n*, *m* and *k* (2 ≤ *k* ≤ *n* ≤ 10^{9}; 0 ≤ *m* ≤ *n*).

Output

Print a single integer — the remainder from division of Manao's minimum possible score in the quiz by 1000000009 (10^{9} + 9).

Examples

Input

5 3 2

Output

3

Input

5 4 2

Output

6

Note

Sample 1. Manao answered 3 questions out of 5, and his score would double for each two consecutive correct answers. If Manao had answered the first, third and fifth questions, he would have scored as much as 3 points.

Sample 2. Now Manao answered 4 questions. The minimum possible score is obtained when the only wrong answer is to the question 4.

Also note that you are asked to minimize the score and not the remainder of the score modulo 1000000009. For example, if Manao could obtain either 2000000000 or 2000000020 points, the answer is 2000000000 *mod* 1000000009, even though 2000000020 *mod* 1000000009 is a smaller number.

Codeforces (c) Copyright 2010-2023 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Nov/28/2023 22:44:35 (k3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|