The first line contains single integer T – the number of test cases. Each test case consists of a single line containing two integers A and B separated by a single space.

内存限制：128 MiB 时间限制：1 Sec

John and Brus are freshmen at the primary school. Their first home task is to learn some integer numbers. It is not so hard for the guys and they decide to impress their teacher by learning all lucky numbers between A and B, inclusive.

As you already know from the previous year contest 4 and 7 are lucky digits, and all the other digits are not lucky. A lucky number is a number that contains only lucky digits in decimal notation.

After learning all lucky numbers in [A, B] range John and Brus still have some free time and now they decide to learn additionally each lucky number N that is out of [A, B] range, but the reversed number of N is in this range. Here reversed number of N is the number N written in decimal notation, but the order of digits is reversed. For example, the reversed number of 447 is 744 and reversed number of 774474444 is 444474477.

You are given integers A and B and your task is to find the total number of lucky numbers learned by John and Brus.

As you already know from the previous year contest 4 and 7 are lucky digits, and all the other digits are not lucky. A lucky number is a number that contains only lucky digits in decimal notation.

After learning all lucky numbers in [A, B] range John and Brus still have some free time and now they decide to learn additionally each lucky number N that is out of [A, B] range, but the reversed number of N is in this range. Here reversed number of N is the number N written in decimal notation, but the order of digits is reversed. For example, the reversed number of 447 is 744 and reversed number of 774474444 is 444474477.

You are given integers A and B and your task is to find the total number of lucky numbers learned by John and Brus.

只有4和7组成的数字被定义成lucky-number（一下简称LN）。求出[a,b]区间内的LN数量和本身不在[a,b]区间内但是逆序之后在[a,b]区间内的LN数量。其中ab的长度小于等于48。

The first line contains single integer T – the number of test cases. Each test case consists of a single line containing two integers A and B separated by a single space.

For each test case print a single line containing the total number of lucky numbers learned by John and Brus.

```
2
```

1 100

44 47

```
6
```

3

Hint

Constraints:

1 ≤ T ≤ 74,

1 ≤ A ≤ B ≤ 100000000000000000000000000000000000000000000000 (1047).