`#include<bits/stdc++.h>
using namespace std;
int prime(int);
int main()
{
int n,i,p,q,j;
cin>>n;
for(i=0;i<n;i++)
{
cin>>p>>q;
for(j=p;j<=q;j++)
{
if(prime(j))
{
if(j!=1){
cout<<j<<"\n";}
}
}
cout<<"\n";
}
}
int prime(int n)
{
int i,flag=0;
for(i=2;i<=(long long)sqrt(n);i++)
{
if(n%i==0)
flag=1;
}
if(flag==0)
return 1;
else
return 0;
}`
Can somone tell me how to deal with TLE?