Codeforces celebrates 10 years! We are pleased to announce the crowdfunding-campaign. Congratulate us by the link https://codeforces.com/10years.
×

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

D2. The Wall (medium)

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputHeidi the Cow is aghast: cracks in the northern Wall? Zombies gathering outside, forming groups, preparing their assault? This must not happen! Quickly, she fetches her HC^{2} (Handbook of Crazy Constructions) and looks for the right chapter:

How to build a wall:

- Take a set of bricks.
- Select one of the possible wall designs. Computing the number of possible designs is left as an exercise to the reader.
- Place bricks on top of each other, according to the chosen design.

This seems easy enough. But Heidi is a Coding Cow, not a Constructing Cow. Her mind keeps coming back to point 2b. Despite the imminent danger of a zombie onslaught, she wonders just how many possible walls she could build with up to *n* bricks.

A wall is a set of wall segments as defined in the easy version. How many different walls can be constructed such that the wall consists of at least 1 and at most *n* bricks? Two walls are different if there exist a column *c* and a row *r* such that one wall has a brick in this spot, and the other does not.

Along with *n*, you will be given *C*, the width of the wall (as defined in the easy version). Return the number of different walls modulo 10^{6} + 3.

Input

The first line contains two space-separated integers *n* and *C*, 1 ≤ *n* ≤ 500000, 1 ≤ *C* ≤ 200000.

Output

Print the number of different walls that Heidi could build, modulo 10^{6} + 3.

Examples

Input

5 1

Output

5

Input

2 2

Output

5

Input

3 2

Output

9

Input

11 5

Output

4367

Input

37 63

Output

230574

Note

The number 10^{6} + 3 is prime.

In the second sample case, the five walls are:

B B

B., .B, BB, B., and .B

In the third sample case, the nine walls are the five as in the second sample case and in addition the following four:

B B

B B B B

B., .B, BB, and BB

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Feb/26/2020 10:25:15 (f3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|