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道题目的时候当前分数翻倍，然后开始重新计数连续答对的题数。当然中间若有答错，也开始重新计数。

思路：我们考虑n个数分成连续的k个树有几段，设x = n/k ， 那么我们就可以知道x段连续的区间里面如果每一段都让它错一个那么我们至少可以答对x*(k-1)，现在我们去判断x*(k-1) >= m, 如果是那么答案就是m，否则就去判断剩下的问题就是t = n-x*k 和 剩下的答对问题的个数为z = m-x*(k-1)，如果t >= z那么ans就是x*(k-1)+z , 否则的话我们知道应该要把后面的错的个数拿来用，那么我们可以求出拿来用的个数t-z。那么接下来只要去求连续的t+(t-z)*k个数的得分加上后面的一段即可

#include<stdio.h>  
#include<string.h>   
#include<algorithm>
#define MOD 1000000009  
using namespace std;  
int n , m , k;  
__int64 Pow(__int64 m , __int64 n)
{  
    __int64 ans = 1;  
    while(n)
	{  
        if(n&1)   
            ans = (ans*m)%MOD;  
        m = (m*m)%MOD;  
        n=n/2;  
    }  
    return ans;  
}  
__int64 getAns()
{  
    int numk = n/k;//被划分的组数   
    if(numk*(k-1) >= m) //第一种情况 
        return m;  
    int rest_n = n-k*numk; //剩下的没有分组的 
    int rest_m = m-numk*(k-1);//除了每组答对k-1个，还剩下的要答对的 
    if(rest_m <= rest_n)  //第二种情况 
        return (numk*(k-1)+rest_m)%MOD;  
    int t = rest_m-rest_n;  //需要连续答对的组数  
    __int64 ans = (numk-t)*(k-1)%MOD; //后面的部分 
    ans=(ans+rest_n)%MOD;//加上没有分组的 
    ans=ans+2*(k*(Pow(2,t)-1))%MOD;//前面的部分 
    return ans%MOD;  
}  
int main()
{  
    while(scanf("%d%d%d",&n,&m,&k)!=EOF)
	{  
        printf("%I64d\n",getAns());  
    }  
    return 0;  
}