codeforces-337【C思维，贪心】

题目链接：点击打开链接

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 个题,答对一个题目加 1 分，然后计数器加 1，如果错一个，计数器就变成了 0。连续答对 k 个题，先加上这个题的 1 分，然后再乘上 2，计数器清零。问给你一个 m，k 求最少得到的分。

思路：先把第 k，2k，3k...这样的位置全部答错，意思就是没有翻倍的情况。如果 m 比这样所有的分加起来，就有翻倍的情况了。最后统计翻倍的和会发现是等比数列的和，需要用到快速幂。然后就是再加上后面没有翻倍的，记住取余的时候，要注意出现负数的情况，加个取余数再取余。

#include<cstdio>
#include<algorithm>
#include<cstring>
#define LL long long
using namespace std;
const LL MOD=1e9+9; 
LL n,m,k;
LL qpow(LL a,LL b)
{
	LL ans=1;
	while(b)
	{
		if(b&1)
		{
			ans=ans*a%MOD;
		}
		a=a*a%MOD;
		b>>=1;
	}
	return ans;
}
int main()
{
	while(~scanf("%I64d%I64d%I64d",&n,&m,&k))
	{
		LL got=(k-1)*(n/k)+n%k; // 第 k,2k,3k...全部错的得分 
		if(m<=got)
		{
			printf("%I64d\n",m);
			continue;
		}
		LL num=m-got; // 翻倍的个数 
		LL cnt=((n/k-num)*(k-1)+n%k)%MOD; // 不翻倍的得分 
		// 这里这个 qpow(2,num+1)-2) 可能为负值 
		LL ans=((qpow(2,num+1)-2)*k%MOD+MOD)%MOD; // 翻倍的得分
		ans=(cnt+ans)%MOD;
		printf("%I64d\n",ans);
	}
	return 0;
}