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).
Input
First line contains an integer T(1 <= T <= 100000) which denotes the total number test cases. Each test case consists of two integers A and B (1 <= A, B <= 100000) on a single line.
Output
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.
Example
Input: 2
3 6
7 10
Output: 2
3
hide comments
divyansh_soni:
20180806 23:10:45
silly mistake can give WA:


viratian_070:
20170626 20:57:17
nice question...silly mistake costed me 4 wa...bitmask and seive will work 

bsiddhartha:
20170622 07:39:44
no subsequence(considering the integer as a string of digits)


Dushyant Singh:
20170331 21:23:13
A>B possible.


holmesherlock:
20170331 20:46:55
excellent prob, use of bitmask,sieve etc.will give u A.C.


sultania23:
20170324 11:11:28
easy one..


shahzada:
20170301 06:15:07
Precompute and answer all queries in O(1). 

abhishekx300:
20160512 14:36:48
i/p:


newbie:
20151114 19:26:38
finally ac after 6 wa's good luck :) 0 & 1 are strictly not prime good luck :) 

newbie:
20151114 19:25:17
1. Swap if(a>b)

Added by:  amit karmakar 
Date:  20110815 
Time limit:  1s3s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  own problem used in  http://www.spoj.pl/MAIN11/ 