Description

A bee is crawling on the digital honeycomb shown in the figure below. It is known that the bee can only crawl from a cell with a smaller number to an adjacent cell with a larger number. Now the question is: How many different crawling routes are there for the bee to go from cell M to cell N, where M

Input Format

Input the values of M and N, where 1 ≤ M < N ≤ 1000.

Output Format

The number of different crawling routes.

```input1 1 14 ``` ```output1 377 ``` ```markdown ## Source

CodesOnline

(Note: The translation remains the same as "CodesOnline" is already in English and there is no additional context provided to warrant a different translation. The markdown formatting with the heading `## Source` is preserved as instructed.)