19001번 - Rikka with XOR 다국어

문제

When Rikka was a little girl, she met a hard but interesting problem "A good task to defend AK". This problem used some properties of XOR (exclusive OR, denoted by "$\oplus$" as a binary operation).

Time flies, six years have passed. Rikka has become a college student. Today, Rikka recollected this problem, and she suddenly understood that she knows little about XOR. So she wanted to come up with some problems about XOR and try to solve them.

Most of the problems were very simple, except one of them. Soon, Rikka found it too difficult. So she asked you to give her some help.

Here is the problem. Given two integers $n$ and $m,ドル calculate $\prod\limits_{i = 0}^{m} (n \oplus i)$. The answer may be very large, so just find it modulo 1ドル,500円,000円,001円$ (which is a prime number).

입력

The first line contains a single integer $t$ (1ドル \leq t \leq 20$), the number of test cases.

Each test case is given on a separate line which contains two integers $n$ and $m$ (1ドル \leq m < n \leq 10^9$).

출력

For each test case, print a single integer: the answer modulo 1ドル,500円,000円,001円$.

제한

힌트