#include<stdio.h>
#include<math.h>
int prime(int m);
int main()
{
int m,n,sum,count;
printf("m n\n");
scanf("%d%d",&m,&n);
sum=0;
count=0;
for(m;m<=n;m++){
if(prime(m)!=0){
printf("%d",m);
count++;
sum=sum+m;
printf("sum=%d,count=%d\n",sum,count);}}
return 0;
}
int prime(int m)
{
int x;
double y;
if(m==1)return 0;
y=sqrt(m);
for(x=2;x<=y;x++)
if(m%x==0){
return 0;
}
return 1;