eolymp
bolt
Try our new interface for solving problems
Problems

The Lucky Numbers

The Lucky Numbers

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 \textbf{A} and \textbf{B}, inclusive. As you already know from the previous year contest \textbf{4} and \textbf{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 \[\textbf{A}, \textbf{B}\] range John and Brus still have some free time and now they decide to learn additionally each lucky number \textbf{N} that is out of \[\textbf{A}, \textbf{B}\] range, but the reversed number of \textbf{N} is in this range. Here reversed number of \textbf{N} is the number \textbf{N} written in decimal notation, but the order of digits is reversed. For example, the reversed number of \textbf{447} is \textbf{744} and reversed number of \textbf{774474444} is \textbf{444474477}. You are given integers \textbf{A} and \textbf{B} and your task is to find the total number of lucky numbers learned by John and Brus. \InputFile 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. \OutputFile For each test case print a single line containing the total number of lucky numbers learned by John and Brus. \textbf{Constraints} 1 ≤ T ≤ 74, 1 ≤ A ≤ B ≤ 100000000000000000000000000000000000000000000000 (10^47).
Time limit 1 second
Memory limit 64 MiB
Input example #1
2
1 100
44 47
Output example #1
6
3
Source Southeastern European Regional Programming Contest, Bucharest, Romania, October 17, 2009