WHAT OPTIMIZATIONS ARE NEEDED?/
#include <bits/stdc++.h>
using namespace std;
int prime(int sum)
{
int i;
if(sum==1)return 0;
int q=sqrt(sum);
for(i=2;i<=q;i++)
{
if(sum%i==0)break;
}
if(i==q+1)return 1;
else return 0;
}
int main() {
int t;cin>>t;
while(t)
{
t--;
int m,n;cin>>m>>n;
int sum=0,count=0;
for(int i=m;i<=n;i++)
{
for(int j=1;j<=i;j++)
{
if(i%j==0)sum=sum+j;
}
if(prime(sum))count++;
sum=0;
}cout<<count<<endl;
}
return 0;
}