A + B balls are arranged in a row. The leftmost A balls are colored red, and the rightmost B balls are colored blue.

You perform the following operation:

* First, you choose two integers s, t such that 1 \leq s, t \leq A + B.
* Then, you repeat the following step A + B times: In each step, you remove the first ball or the s-th ball (if it exists) or the t-th ball (if it exists, all indices are 1-based) from left in the row, and give it to Snuke.



In how many ways can you give the balls to Snuke? Compute the answer modulo 10^9 + 7.

Here, we consider two ways to be different if for some k, the k-th ball given to Snuke has different colors. In particular, the choice of s, t doesn't matter. Also, we don't distinguish two balls of the same color.

Constraints

* 1 \leq A, B \leq 2000

Input

Input is given from Standard Input in the following format:


A B


Output

Print the answer.

Examples

Input

3 3


Output

20


Input

4 4


Output

67


Input

7 9


Output

7772


Input

1987 1789


Output

456315553
#include"bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
 
using namespace std;
 
#define MAX 4002
 
 
long long int dp[MAX][2002][2];
 
int A;
int B;
 
bool use[MAX][2002][2];
#define MOD 1000000007
 
long long int C[2002][2002];
long long int su[2002][2002];
 
inline long long int dfs(int a, int b, int c) {
	if (a == A + B) {
		return 1;
	}
	if (use[a][b][c]) {
		return dp[a][b][c];
	}
	use[a][b][c] = true;
	dp[a][b][c] = 0;
	if (c == 0) {
		if (a + 1 <= A) {
			//choose A
			dp[a][b][c] += dfs(a + 1, b, c);
		}
		//choose B
		if (B) {
			int resta = A - a;
			int restb = B;
			int rng = B;
			rng--;
			for (int i = 0; i <= rng; i++) {
				int placeA = rng - i;
				if (placeA <= resta) {
					dp[a][b][c] += dfs(a + B, B - i-1, 1)*C[rng][placeA];
					if (dp[a][b][c] >= MOD) {
						dp[a][b][c] %= MOD;
					}
				}
			}
		}
	}
	if (c == 1) {
		int selb = B - b;
		int sela = a - selb;
		int resta = A - sela;
		if (resta) {
			dp[a][b][c] += dfs(a + 1, b, c);
		}
		//choose B
		int restb = b;
		if (restb) {
			int rng = restb;
			rng--;
			int mint = min(resta, rng);
			dp[a][b][c] += su[rng][mint];
			if (dp[a][b][c] >= MOD)dp[a][b][c] %= MOD;
		}
	}
	return dp[a][b][c];
}
 
int main() {
	C[0][0] = 1;
	for (int i = 0; i < 2000; i++) {
		for (int j = 0; j <= i; j++) {
			C[i + 1][j] += C[i][j];
			C[i + 1][j + 1] += C[i][j];
			C[i + 1][j] %= MOD;
			C[i + 1][j + 1] %= MOD;
		}
	}
	for (int i = 0; i < 2000; i++) {
		for (int j = 0; j < 2000; j++) {
			su[i][j] = C[i][j];
			if (j) {
				su[i][j] += su[i][j - 1];
				su[i][j] %= MOD;
			}
		}
	}
	cin >> A >> B;
	long long int ans = dfs(0, 0, 0);
	ans %= MOD;
	printf("%lld\n", ans);
	return 0;
}