GEEKOUNT - EVEN COUNT

Let f(x) be the product of digits of a number.

Given L and R, find the number of values of 'i' such that L ≤ i ≤ R and f(i) is even.

Input

The first line consists of an integer t, the number of test cases. For each test case, you are given the two integers L and R.

Output

For each test case, print the number of values of 'i' such that L ≤ i ≤ R and f(i) is even.

Constraints

1 ≤ t ≤ 100

1 ≤ L ≤ R ≤ 1000000000

Sample

Input:
2
2 12
4 23

Output:
6
12

Added by:cegprakash
Date:2013-01-15
Time limit:2s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: BF
Resource:problem setter: rkarthikeyan

hide comments
2013-04-14 22:22:54 Haijun Deng
Got WA, any tricky cases?
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.