#include #include int t,n; int primesQ[100010]; bool prime[100010]; int main() { memset(prime,0,sizeof(prime)); prime[0]=1; prime[1]=1; primesQ[0]=0; primesQ[1]=0; for(int i=2;i<=100000;i++) { if(prime[i]==0) { for(int j=2*i;j<=100000;j+=i) prime[j]=1; primesQ[i]=primesQ[i-1]+1; } else { primesQ[i]=primesQ[i-1]; } } scanf("%d",&t); for(int m=0;m