Let's define the transformation $*P*$ of a sequence of integers $*a*_{1}, *a*_{2}, ..., *a*_{*n*}$ as $*b*_{1}, *b*_{2}, ..., *b*_{*n*}$, where $*b*_{*i*} = *a*_{1} | *a*_{2} | ... | *a*_{*i*}$ for all $*i* = 1, 2, ..., *n*$, where $|$ is the bitwise OR operation.

Vasya consequently applies the transformation $*P*$ to all sequences of length $*n*$ consisting of integers from $1$ to $2^{*k*} - 1$ inclusive. He wants to know how many of these sequences have such property that their transformation is a strictly increasing sequence. Help him to calculate this number modulo $10^{9} + 7$.

Input

The only line of the input contains two integers $*n*$ and $*k*$ ($1 ≤ *n* ≤ 10^{18}, 1 ≤ *k* ≤ 30 000$).

Output

Print a single integer — the answer to the problem modulo $10^{9} + 7$.