Prime visit problem

why one test case is fail, plz tell me

#include
#define ll long long
using namespace std;
void prime_seive(int p)
{
for(int i=3;i<=100000;i+=2)
{
p[i]=1;
}
for(ll i=3;i<=100000;i+=2)
{
if(p[i]==1)
{
for(ll j=2
i;j<=100000;j=j+i)
{
p[j]=0;
}
}
}
p[2]=1;
p[1]=p[0]=0;
}
int main() {
int p[100000]={0};
prime_seive§;
int csum[100000]={0};
for(int i=1;i<100000;i++)
{
csum[i]=csum[i-1]+p[i];
}
int n;
cin>>n;
while(n–)
{
int a,b;
cin>>a>>b;
cout<<csum[b]-csum[a-1]<<"\n";
}
return 0;
}