#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e4 + 5;
int n , m;
int cnt , f;
int ans;
bool flag[N];
int su[N];
int mark[N];
void o_sieve(int n){
flag[1] = 0;
for(int i = 2 ; i <= n ; i++){
if(flag[i]) su[++cnt] = i;
for(int j = 1 ; j <= cnt && i * su[j] <= n ; j++) {
flag[i * su[j]] = 0;
if(i % su[j] == 0) break;
}
}
}
signed main() {
cin >> n >> m;
memset(flag , 1 , sizeof(flag));
o_sieve(n);
while(n--){
ans = 0;
int x , y;
cin >> x >> y;
if(y > m || x < 1){
cout << "Crossing the line\n";
continue;
}
for(int i = 1 ; i <= cnt ; i++){
if(su[i] > y) break;
if(su[i] <= y && su[i] >= x){
ans++;
cout << su[i] << endl;
}
}
cout << ans << "\n";
}
return 0;
}



大佬求条