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>
using namespace std;
 
typedef long long LL;
typedef pair<int, int> pii;
 
#define fst first
#define snd second
#define pb push_back
#define REP(i, a, b)  for(int i = (a), i##end = (b); i < i##end; ++i)
#define DREP(i, a, b) for(int i=(a-1), i##end = (b); i >=i##end; --i)
 
template <typename T> bool chkmax(T& a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> bool chkmin(T& a, T b) { return a > b ? a = b, 1 : 0; }
 
const int oo = 0x3f3f3f3f;
const int maxn = 2000 + 5;
const int mod = 1e9 + 7;
 
template<typename T> T read() {
    T n(0), f(1);
    char ch = getchar();
    for( ;!isdigit(ch); ch = getchar()) if(ch == '-') f = -1;
    for( ; isdigit(ch); ch = getchar()) n = n * 10 + ch - 48; 
    return n * f;
}

int A, B;
LL C[maxn][maxn], D[maxn][maxn];

void init() {
    for(int i = 0; i < maxn; ++i) {
        C[i][0] = C[i][i] = 1;
        for(int j = 1; j < i; ++j) 
            C[i][j] = (C[i-1][j-1] + C[i-1][j]) % mod;
    }

    for(int i = 0; i < maxn; ++i) {
        D[i][0] = C[i][0];
        for(int j = 1; j < maxn; ++j)
            D[i][j] = (D[i][j-1] + C[i][j]) % mod;
    }
}

int main() {
#ifdef Wearry
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
#endif

    init();
    cin >> A >> B;

    LL ans = 0;
    for(int i = 0; i <= A; ++i) {
        LL res = 0;
        for(int j = 1; j <= A - i; ++j) {
            res = (res + C[B - 1][j] * D[j - 1][A - i - j]) % mod;
        }
        ans = (ans + (i + 1) * res) % mod;
    }
    ans = (ans + A + 1) % mod;
    printf("%lld\n", ans);

    return 0;
}
