LUCIFER  LUCIFER Number
Lucifer is the only human whi has defeated RAONE in a computer game ..
RAOne is after lucifer for revenge and GOne is there to protect him ...
All thi GOne and Raone Nonsense has disturbed lucifers life..
He wants to get Rid of RaOne and kill him . He found that RaOne can be killed only by throwing Lucifer number of weapons at him.
Lucifer number shares the some properties of RaOne Numbers numbers and GOne Numbers
Any number is LUCIFER NUMBER if the Difference between Sum of digits at even location and Sum of digits at odd location is prime number .. For eg... for 20314210 is lucifer number
digits at odd location 0,2,1,0
digits at even location 1,4,3,2
diff = (1+4+3+2)(0+2+1+0)=103 = 7 ..... a prime number.
Lucifer has access to a Warehouse which has lots of weapons ..
He wants to know in how many ways can he kill him.
Can you help him?
Input
First line will have a number 't' denoting the number of test cases.
each of the following t lines will have 2 numbers 'a' , 'b'
Output
Print single number per test case, depicting the count of Lucifer numbers in the range a,b inclusive.
Example
Input:
5
200 250
150 200
100 150
50 100
0 50
Output:
2
16
3
18
6NOTE: t will be less than 100
from and to will be between 0 and 10^9 inclusive
hide comments
Surya kiran:
20120406 09:55:24
aaaah...can the size limit of the problem be increased ???? 

Devil D:
20120406 09:55:24
@Erben


Mitch Schwartz:
20120406 09:55:24
@Erben: We are not considering negative numbers as prime. 

Erben:
20120406 09:55:24
Are there only 2 Lucifer numbers in the range of 200250?


Devendar:
20120406 09:55:24
getting time limit exceeded..... any clues 
Added by:  Devil D 
Date:  20120309 
Time limit:  0.100s0.5s 
Source limit:  10000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  Own 