#include<iostream>
using namespace std;
const int N=1e6+10;
int l,r;
int n,m;
int prime[N],b[N],cnt;
int s[N];
int main(){
cin>>n>>m;
for(int i=2;i<=m;i++){
if(!b[i]){
prime[cnt++]=i;
s[i]=1+s[i-1];
}
else s[i]=s[i-1];
for(int j=0;prime[j]<=n/i;j++){
b[prime[j]*i]=1;
if(i%prime[j]==0)break;
}
}
for(int i=1;i<=n;i++){
cin>>l>>r;
if(l<1||r>m){
cout<<"Crossing the line"<<endl;
continue;
}
else cout<<s[r]-s[l-1]<<endl;
}
return 0;
}