Problem:
Score : 1600 points

Problem Statement

There are N zeros and M ones written on a blackboard.
Starting from this state, we will repeat the following operation: select K of the rational numbers written on the blackboard and erase them, then write a new number on the blackboard that is equal to the arithmetic mean of those K numbers.
Here, assume that N + M - 1 is divisible by K - 1.

Then, if we repeat this operation until it is no longer applicable, there will be eventually one rational number left on the blackboard.

Find the number of the different possible values taken by this rational number, modulo 10^9 + 7.

Constraints

1 ≦ N, M ≦ 2000

2 ≦ K ≦ 2000

N + M - 1 is divisible by K - 1.

Input

The input is given from Standard Input in the following format:

N M K

Output

Print the number of the different possible values taken by the rational number that will be eventually left on the blackboard, modulo 10^9 + 7.

Sample Input 1

2 2 2

Sample Output 1

5

There are five possible values for the number that will be eventually left on the blackboard: \frac{1}{4}, \frac{3}{8}, \frac{1}{2}, \frac{5}{8} and \frac{3}{4}.

For example, \frac{3}{8} can be eventually left if we:

Erase 0 and 1, then write \frac{1}{2}.

Erase \frac{1}{2} and 1, then write \frac{3}{4}.

Erase 0 and \frac{3}{4}, then write \frac{3}{8}.

Sample Input 2

3 4 3

Sample Output 2

9

Sample Input 3

150 150 14

Sample Output 3

937426930

Solution in C++14 (GCC 5.4.1) (judge verdict: Accepted)

#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;

const int MAX_N = 2005, MOD = 1000000007;

int N, M, K, f[MAX_N], g[MAX_N];

void update(int &x, int y) {
  x = (x + y) % MOD;
}

int main() {
  scanf("%d%d%d", &N, &M, &K);
  M--;
  
  int len = (N + M) / (K - 1), result = 0, sum = 0;
  f[0] = 1;
  
  for (int i = 1; i <= len; ++i) {
    memset(g, 0, sizeof g);
    sum += K - 1;
    
    for (int j = 0; j <= N; ++j) {
      for (int k = 0; k <= K - 1; ++k) {
	if (j + k <= N && sum - j - k <= M) {
	  update(g[j + k], f[j]);
	  if (k > 0 && (j + k) % (K - 1) == N % (K - 1) && (sum - j - k) % (K - 1) == M % (K - 1))
	    update(result, f[j]);
	}	  
      }
    }
    
    memcpy(f, g, sizeof g);
  }

  printf("%d\n", result);
  return 0;
}