CodeForces 337C. Quiz

C. Quiz

time limit per test

 1 second

memory limit per test

 256 megabytes

input

 standard input

output

 standard output

Manao 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 (109 + 9).

Input

The single line contains three space-separated integers n, m and k (2 ≤ k ≤ n ≤ 109; 0 ≤ m ≤ n).

Output

Print a single integer — the remainder from division of Manao's minimum possible score in the quiz by 1000000009 (109 + 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 though2000000020 mod 1000000009 is a smaller number.

题意：有n道题目，要求在答对m道题目的情况下所得到的最小的分数。每答对一道题目 加一分，并且在连续答对k道题目的时候当前分数翻倍，然后开始重新计数连续答对的题数。当然中间若有答错，也开始重新计数。

    一看题以为就是一个简单的贪心，做完了交了一发wrong了原来是long long 过程中没去mod也超了，改了后就超时了，后来发现原来有个数学替换式，前一部分的等分就等于2*（k*(pow(2,t,mod）-1)) 然后用快速取幂，感觉第一次用的话比较难想到。

1. #include <stdio.h>  
2. #define mod 1000000009  
3. int pow_mod(long long a,long long n,long long m)  
4. {  
5.     long long ret = 1;  
6.     while(n)  
7.     {  
8.         if(n&1) ret = ret*a%m;  
9.         a = (a*a)%m;  
10.         n >>= 1;  
11.     }  
12.     return (int)ret%m;  
13. }  
14. int main()  
15. {  
16.     int n,m,k;  
17.     scanf("%d%d%d",&n,&m,&k);  
18.     int s1 = n/k;  
19.     int s2 = n-m;  
20.     if(s1-s2 < 0) printf("%d\n",m);  
21.     else  
22.     {  
23.         int exp = s1 - s2;  
24.         long long ans = 0;  
25.         ans = pow_mod(2,exp+1,mod) - 2;  
26.         ans = (ans*k + mod)%mod;  
27.         ans = (ans + (long long) s2 * (k-1) + n%k) % mod;  
28.         printf("%I64d\n",ans);  
29.     }  
30.     return 0;  
31. }