#### Description

• Miguel Angelo is a great sculptor, widely recognized for his outdoor sculptures. In his hometown, it is very common to  nd one of his creations in squares and gardens. People love his sculptures, not only for their beauty, but also because they look like new even after decades. The sculptures do not degrade easily due to the material and technique developed by Miguel and his sta  over the years.

To build the sculptures, he  rst constructs its base by stacking blocks of waterproof plaster (his secret material), forming several stacks of blocks in a straight line. He always uses identical blocks, and each stack has at least one block. To stabilize the structure, he surrounds it by two big glass panes, one behind the stacks and one in front of them. Then he waits for the rain for as long as it takes. If the structure is such that it doesn't accumulate water during this procedure, Miguel is sure that the base can be used to obtain a piece of long-lasting artwork. Notice that water will accumulate on a block if there are obstacles (other blocks) on both sides (to the left and to the right).

The following picture shows the front view of several different bases. All of them consist of three stacks made of a total of six blocks, with each stack having at least one block as required. However, the eight bases on the left will lead to long-lasting artwork, while the two bases on the right will not.

Miguel Angelo is receiving a lot of sculpture requests. Although he has all the freedom to create the artwork, he wants to be fair and use the same number of stacks and the same number blocks in each of the sculptures. Since he doesn't want to sell identical sculptures to different clients, he will construct a different base each time.

He worries that he won't be able to fullfill all the requests. Help him calculate the number of different bases given the number of stacks and the number of blocks that the base must have.

#### Input

The input consists of a single line that contains two integers \$S\$ and \$B (1 \leq S \leq B \leq 5000)\$ indicating respectively the number of stacks and the number of blocks that the base must have.

#### Output

Output a single line with an integer indicating the number of different bases that don't accumulate water which Miguel can construct. Because this number can be very large, output the remainder of dividing it by \$10^9 + 7\$.

#### Samples

Input Copy
3 6
Output
8
Input Copy
3 7
Output
12

#### Source

ICPC Latin American Regional 2019
##### Problem Information

 Time Limit: 1000MS (C/C++,Others×2) Memory Limit: 300MB (C/C++,Others×2) Special Judge: No AC/Submit: 6 / 11 Tags:
##### Contests involved

 1039. ICPC Latin American Regional 2019