SP9385 MAIN111 - Strictly not a Prime

Tim defines an integer as "Strictly not a Prime", if no subsequence(considering the integer as a string of digits) of the integer is a prime. He needs your help in finding how many such integers are present between two given integers A and B(including A and B).

First line contains an integer T(1

For each test case, print the total count of integers which are "Strictly not a prime" between A and B(including A and B) as per tim.