Problem Description

Translated from COCI 2010.02 T5 "KABOOM"

Note the time limit for this problem.

Luka found a strange tape in the laboratory. The tape is divided into $N$ segments, numbered from $1$ to $N$ from left to right. The thickness of the tape is negligible.

The tape can only be bent at the intersections of segments and can only be folded by 180°.

There are two sides to the tape. One side is covered with extremely sticky glue, while the other side has the first $A$ segments and the last $B$ segments coated with extremely sticky glue.

How many ways can Luka fold the tape to restore the scene (Luka's hands will not stick to the tape, but if two glued sides stick together, Luka won't be able to separate them)? The answer should be taken modulo $10301$.

Input Format

The first line contains three integers $N, A, B$.

Output Format

Output a single integer, the answer.

Sample Input and Output

Sample Input #1

4 1 1

Sample Output #1

6

Sample Input #2

5 2 2

Sample Output #2

1

Sample Input #3

6 1 2

Sample Output #3

7

Notes/Hints

Sample Explanation 1

Data Range and Hints

$1 \le A + B \le N \le 1000$, $A > 0$, $B > 0$.

见题面 Input 部分

见题面 Output 部分