#include<stdio.h>
#include<math.h>
#define MAX 100001
char arr[MAX];
int t;
long long m,n;
void prime()
{
int i,j;
for(i=0;i<=MAX;i++)
arr[i]=0;
arr[0]=1,arr[1]=1;
for(i
=2;i
<=(int)sqrt(MAX
);i
++){ for(j=2;j*i<=MAX;j++)
arr[i*j]=1;
}
}
int main()
{
long long i;
// long long m,n;
prime();
while(t--){
scanf("%lld %lld",&m
,&n
); for(i=m;i<=n;i++){
if(arr[i]==0){
}
}
}
return 0;
}
I2luY2x1ZGU8c3RkaW8uaD4KI2luY2x1ZGU8bWF0aC5oPgojZGVmaW5lIE1BWCAxMDAwMDEKCmNoYXIgIGFycltNQVhdOwppbnQgdDsKbG9uZyBsb25nIG0sbjsKdm9pZCBwcmltZSgpCnsKICAgIGludCBpLGo7CiAgICBmb3IoaT0wO2k8PU1BWDtpKyspCiAgICAgICAgYXJyW2ldPTA7CiAgICBhcnJbMF09MSxhcnJbMV09MTsKICAgIGZvcihpPTI7aTw9KGludClzcXJ0KE1BWCk7aSsrKXsKICAgICAgICBmb3Ioaj0yO2oqaTw9TUFYO2orKykKICAgICAgICAgICAgYXJyW2kqal09MTsKICAgIH0KfQppbnQgbWFpbigpCnsKICAgIGxvbmcgbG9uZyBpOwogICAvLyBsb25nIGxvbmcgbSxuOwogICAgc2NhbmYoIiVkIiwmdCk7CiAgICBwcmltZSgpOwogICAgd2hpbGUodC0tKXsKICAgICAgICBzY2FuZigiJWxsZCAlbGxkIiwmbSwmbik7CiAgICAgICAgZm9yKGk9bTtpPD1uO2krKyl7CiAgICAgICAgICAgIGlmKGFycltpXT09MCl7CiAgICAgICAgICAgICAgICBwcmludGYoIiVsbGQiLGkpOwogICAgICAgICAgICAgICAgcHJpbnRmKCJcbiIpOwogICAgICAgICAgICB9CiAgICAgICAgfQogICAgICAgIHByaW50ZigiXG4iKTsKICAgIH0KICAgIHJldHVybiAwOwp9Cg==