Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-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

G. Sherlock and the Encrypted Data

time limit per test

2 secondsmemory limit per test

512 megabytesinput

standard inputoutput

standard outputSherlock found a piece of encrypted data which he thinks will be useful to catch Moriarty. The encrypted data consists of two integer *l* and *r*. He noticed that these integers were in hexadecimal form.

He takes each of the integers from *l* to *r*, and performs the following operations:

- He lists the distinct digits present in the given number. For example: for 1014
_{16}, he lists the digits as 1, 0, 4. - Then he sums respective powers of two for each digit listed in the step above. Like in the above example
*sum*= 2^{1}+ 2^{0}+ 2^{4}= 19_{10}. - He changes the initial number by applying bitwise xor of the initial number and the sum. Example: . Note that xor is done in binary notation.

One more example: for integer 1e the sum is *sum* = 2^{1} + 2^{14}. Letters a, b, c, d, e, f denote hexadecimal digits 10, 11, 12, 13, 14, 15, respertively.

Sherlock wants to count the numbers in the range from *l* to *r* (both inclusive) which decrease on application of the above four steps. He wants you to answer his *q* queries for different *l* and *r*.

Input

First line contains the integer *q* (1 ≤ *q* ≤ 10000).

Each of the next *q* lines contain two hexadecimal integers *l* and *r* (0 ≤ *l* ≤ *r* < 16^{15}).

The hexadecimal integers are written using digits from 0 to 9 and/or lowercase English letters a, b, c, d, e, f.

The hexadecimal integers do not contain extra leading zeros.

Output

Output *q* lines, *i*-th line contains answer to the *i*-th query (in decimal notation).

Examples

Input

1

1014 1014

Output

1

Input

2

1 1e

1 f

Output

1

0

Input

2

1 abc

d0e fe23

Output

412

28464

Note

For the second input,

14_{16} = 20_{10}

*sum* = 2^{1} + 2^{4} = 18

Thus, it reduces. And, we can verify that it is the only number in range 1 to 1*e* that reduces.

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/24/2019 02:40:50 (d2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|