Need help with Prime1

[akshay_d1]

I'm not able to figure out the test case which the judge is accepting ... Help me out...
I've tried all the possible cases that i could identify ...

My code:

include

int main(void){
int prime[4000],a[32000],seive[100000],i,j,m,n,count=0,t,l,u,p,diff,p1,s,q;
for(i=1;i<32000;i++){
a[i-1]=i;
}
for(i=1;i<32000;i++){
if(a[i]!=0){
for(j=2*a[i];j<=32000;j=j+a[i]){
a[j-1]=0;

		}
	}
}

for(m =1;m <32000;m ++){
	if(a[m] !=0 ){
		prime[count]=a[m];
		count++;
		}
	}
	scanf("%d",&t);
		while(t--){
			scanf("%d %d",&l,&u);
			if(l<2) l=2;
			if(u-l <100000){
				diff=u-l;
				for(p=0;p <=diff;p++){

					seive[p]=1;
				}

					for(q=0;;q++){
						p1=prime[q];
						if(p1*p1 > u) break;
						n=(l/p1)*p1;
						if(n<l) n=n+p1;
						if(n==p1) n=n+p1;
						for(;n<=u;n=n+p1)
						seive[n-l]=0;
					    }
				for(j=0;j<=diff;j++){
				if(seive[j]) {
					printf("%d\n",l+j);
				}

				}
					}
					printf("\n");		
					}	
					return 0;
				}

[leppyr64]

Please use code tags when posting code.

You have also misread the problem statement. It is not your responsibility to verify that the input matches the input constraints.