0分求调样例过了（改正闭关）

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define x first
#define y second
#define all(x) x.begin(),x.end()
#define PII pair<int,int>
const int N=1e6+10;
int p[N];
bool f[N];
int a[N],k; 
void solve(){
//freopen("pow.in","r",stdin);
//freopen("pow.out","w",stdout);
	int n,m;
	cin>>n>>m;
	for(int i=2;i<=m;i++){
		if(f[i]==0){
			p[k++]=i;
			for(int j=0;j<=m;j+=i){
				f[j]=true;
			}
		}
	}
	while(n--){
		int l,r;
		cin>>l>>r;
		if(l<1||r>m){
			cout<<"Crossing the line";
			continue;
		}
		int ans=0;
		for(int i=l;i<=r;i++){
			if(f[i]){
				ans++;
			}
		}
		cout<<ans<<endl;
	}
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	int t;
	t=1;
	//cin>>t;
	while(t--){
		solve();
	}
	return 0;
}