A10481 | ZS and The Birthday Paradox

ZS the Coder has recently found an interesting concept called the Birthday Paradox. It states that given a random set of $23$ people, there is around $50%$ chance that some two of them share the same birthday. ZS the Coder finds this very interesting, and decides to test this with the inhabitants of Udayland.

In Udayland, there are $2^{n}$ days in a year. ZS the Coder wants to interview $k$ people from Udayland, each of them has birthday in one of $2^{n}$ days (each day with equal probability). He is interested in the probability of at least two of them have the birthday at the same day.

ZS the Coder knows that the answer can be written as an irreducible fraction . He wants to find the values of $A$ and $B$ (he does not like to deal with floating point numbers). Can you help him?

The first and only line of the input contains two integers $n$ and $k$ $(1<=n<=10^{18},2<=k<=10^{18})$ , meaning that there are $2^{n}$ days in a year and that ZS the Coder wants to interview exactly $k$ people.

If the probability of at least two $k$ people having the same birthday in $2^{n}$ days long year equals  ( $A>=0$ , $B>=1$ , ), print the $A$ and $B$ in a single line.

Since these numbers may be too large, print them modulo $10^{6}+3$ . Note that $A$ and $B$ must be coprime before their remainders modulo $10^{6}+3$ are taken.