A number is said to be a 369 number if:

1. The count of 3s is equal to the count of 6s and the count of 6s is equal to the count of 9s.
2. The count of 3s is at least 1.

For Example 12369, 383676989, 396 all are 369 numbers whereas 213, 342143, 111 are not.

Given A and B find how many 369 numbers are there in the interval [A, B]. Print the answer modulo 1000000007.

Input

The first line contains the number of test cases (T) followed by T lines each containing 2 integers A and B.

Output

For each test case output the number of 369 numbers between A and B inclusive.

Constraints

T ≤ 100

1 ≤ A ≤ B ≤ 10⁵⁰

Example

Input:
3
121 4325
432 4356
4234 4325667
Output:
60
58
207159