Lucifer is the only human who has defeated Ra-One in a computer game ...

Ra-One is after Lucifer for revenge and G-One is there to protect him ...

All the G-One and Ra-One nonsense has disturbed Lucifer's life ...

He wants to get rid of Ra-One and kill him. He found that Ra-One can be killed only by throwing Lucifer number of weapons at him.

Lucifer number shares the some properties of Ra-One Numbers numbers and G-One Numbers

Any number is LUCIFER NUMBER if the difference between sum of digits at even location and sum of digits at odd location is prime number. For example, 20314210 is a Lucifer number:

digits at odd location 0, 2, 1, 0.

digits at even location 1, 4, 3, 2.

difference = (1+4+3+2)-(0+2+1+0) = 10-3 = 7 ... a prime number.

Lucifer has access to a warehouse that has lots of weapons. He wants to know in how many ways can he kill him.

Can you help him?

Input

First line will have a number 't' denoting the number of test cases.

each of the following t lines will have 2 numbers 'a', 'b'

Output

Print single number per test case, depicting the count of Lucifer numbers in the range a, b inclusive.

Example

Input:
5
200 250
150 200
100 150
50 100
0 50

Output:
2
16
3
18
6

NOTE: t will be less than 100. 'a' and 'b' will be between 0 and 10⁹ inclusive.