MegaPrime Numbers Problem Statement

Given two integers Left and Right, determine the count of 'megaprime' numbers within the inclusive range from 'Left' to 'Right'. A 'megaprime' number is a prime number where each digit is also a prime number.

Example:

Input:

Left = 23, Right = 37

Output:

2

Explanation:

The prime numbers between 23 and 37 are 23, 29, 31, and 37. Among these:

• 23 is a 'megaprime' because 2 and 3 are prime.
• 29 is not a 'megaprime' because 9 is not prime.
• 31 is not a 'megaprime' because 1 is not prime.
• 37 is a 'megaprime' because 3 and 7 are prime.

Thus, there are two 'megaprime' numbers: 23 and 37.

Constraints:

• 1 ≤ T ≤ 100
• 1 ≤ Left ≤ Right ≤ 8000
• Time Limit: 1 second

Note:

You are not required to print anything; it has been taken care of. Your task is to implement the function and return the count of 'megaprime' numbers for each test case.