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.

题意：

每答对一道题得分 +1，有 n 道题目答对了 m 道，连续答对 k 道，积分翻倍。

问最少的得分是多少。

思路：

快速幂和二分。

AC：

#include<stdio.h>
#include<cstring>
#include<algorithm>
#define AC main()
using namespace std;
const int MYDD = 1103;
const int MOD = 1000000009;
typedef long long LL;

LL FastMod(LL a, LL n, LL b) {//快速幂
	LL tmp;
	if(n == 0) return 1%b;
	if(n == 1) return a%b;
	tmp = FastMod(a, n/2, b);
	tmp = tmp*tmp%b;
	if(n&1) tmp = tmp*a%b;
	return tmp;
}

int AC {
	LL n, m, k;
	while(scanf("%lld %lld %lld", &n, &m, &k) != EOF) {
		LL ans, dd = (n-m) - n/k;
		if(dd >= 0) {//答错题目个数 >= 翻倍的区间数
			printf("%lld\n", m);
		} else {
			dd = -dd;//存在翻倍的区间
			ans = (((2*FastMod(2, dd, MOD) - 2 + MOD)%MOD) * k) % MOD;
			ans += (k-1)*(n-m) + n%k;
			ans %= MOD;
			printf("%lld\n", ans);
		}
	}

	return 0;
}