Alternative for this problem?

#1

alternative for this problem ?
after computing the pre prime seive . can we just iterate from
a to b. for the q queries.

like -
while(n–)
{
for(int i=a;i<=b;i++)
{
if(p[i]==1
cout<<i;
}
}

#2

@mehulbhandari358 yeah this way is also correct but there may be chances of getting TLE.

#3

why are there chances of tle
it has same complexity b-a ?

#4

yeaah for this for problem it may work fine i said just in case of larger constraints.