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 <cstdio>
#include <cstring>
#include <math.h>
#include <vector>
#include <algorithm>
#include <iostream>
#include <queue>
#include <bits/stdc++.h>
#include <iomanip>
#include <string>
#include <map>
using namespace std;
typedef long long LL;
const int N = 4005;
const int K=31;  
const int M=10921000; 
const int INF = 0x3f3f3f3f; 
const LL MOD = 1e9+7;
int n,m;
int a,b;
LL dp[N][N];
LL dp2[N][N];
int main ()
{
    // for(int i=0;i<=4000;i++)
    //     dp[i][0]=1;
    // for(int i=1;i<=4000;i++)
    //     for(int j=1;j<=i;j++)
    //         dp[i][j]=(dp[i-1][j-1]+dp[i-1][j])%MOD;
    for (int i=0;i<N;i++)
        for (int j=0;j<=i;j++)
        {
            if (j==0 || i==j)
                dp[i][j] = 1;
            else
                dp[i][j] = (dp[i-1][j-1]+dp[i-1][j])%MOD;
        }

    // for (int i = 0; i < N; i ++) dp2[i][0] = dp2[i][i] = 1;
    // for (int i = 1; i < N; i ++) {
    //         for (int j = 1; j < i; j ++) {
    //                 dp2[i][j] = (dp2[i - 1][j] + dp2[i - 1][j - 1]) % MOD;
    //         }
    // }
    while (~scanf("%d%d",&a,&b))
    {
        // LL ans=a+1;
        // for(int i=1;i<=b-1;i++)
        //     for(int j=0;j<=min(i-1,n-i);j++){
        //         int res=1;
        //         res=1ll*res*dp[m-1][i]%MOD*dp[i-1][j]%MOD*dp[n-i-j+2][2]%MOD;
        //         ans=(ans+res)%MOD;
        // }
        LL ans = a+1;
        for (int i=1;i<=min(a,b-1);i++)
            for (int j=0;i+j<=a && j<i;j++)
            {
                LL tmp = (dp[b-1][i] * dp[i-1][j])%MOD * dp[a-i-j+2][2]%MOD;
                ans = (ans + tmp)%MOD;
            }
        // for(int i=1;i<=min(a,b-1);i++)
        // {
        //     for(int j=0;j<i&&j+i<=a;j++)
        //     {
        //         LL lin=dp[b-1][i]*dp[i-1][j]%MOD*dp[a-i-j+2][2]%MOD;
        //         cout<<i<<" "<<j<<" "<<lin<<" "<<dp[b-1][i]<<" "<<dp[i-1][j]<<" "<<dp[a-i-j+2][2]<<endl;
        //         ans=(ans+lin)%MOD;
        //     }
        // }
        // cout<<ans<<endl;
        // ans = a+1;
        // for(int i=1;i<=min(a,b-1);i++)
        // {
        //     for(int j=0;j<i&&j+i<=a;j++)
        //     {
        //         LL lin=dp2[b-1][i]*dp2[i-1][j]%MOD*dp2[a-i-j+2][2]%MOD;
        //         cout<<i<<" "<<j<<" "<<lin<<" "<<dp2[b-1][i]<<" "<<dp2[i-1][j]<<" "<<dp2[a-i-j+2][2]<<endl;
        //         ans=(ans+lin)%MOD;
        //     }
        // }
        printf("%lld\n", ans);
    }
    return 0;
}
 
/*
 
6 5
1 2
2 3
3 4
4 5
5 6
 
*/