Incomplete Prime

A number is called an Incomplete Prime if the product of its digits in decimal representation is a prime number. For example, \(12\) is an incomplete prime because \(1 \times 2 = 2\) is prime; however, \(29\) is not an incomplete prime since \(2 \times 9 = 18\) is not prime.

Given two integers \(l\) and \(r\) (with \(l \le r\)), count the number of incomplete primes in the interval \([l, r]\).

inputFormat

The input consists of two integers \(l\) and \(r\) separated by whitespace.

outputFormat

Output a single integer representing the count of incomplete primes in the interval \([l, r]\).

sample

10 20

4