提示: 欢迎访问OurACM平台。
Problem 2109 Mountain Number

Accept: 278    Submit: 706
Time Limit: 1000 mSec    Memory Limit : 32768 KB

Problem Description

One integer number x is called "Mountain Number" if:

(1) x>0 and x is an integer;

(2) Assume x=a[0]a[1]...a[len-2]a[len-1](0≤a[i]≤9, a[0] is positive). Any a[2i+1] is larger or equal to a[2i] and a[2i+2](if exists).

For example, 111, 132, 893, 7 are "Mountain Number" while 123, 10, 76889 are not "Mountain Number".

Now you are given L and R, how many "Mountain Number" can be found between L and R (inclusive) ?

Input

The first line of the input contains an integer T (T≤100), indicating the number of test cases.

Then T cases, for any case, only two integers L and R (1≤L≤R≤1,000,000,000).

Output

For each test case, output the number of "Mountain Number" between L and R in a single line.

Sample Input

3 1 10 1 100 1 1000

Sample Output

9 54 384

Source

“高教社杯”第三届福建省大学生程序设计竞赛

Submit  Back  Status  Discuss