int isPrime(unsigned int n)
{
	unsigned int num;

	if ( n < 2||!(n & 1)) 
		return n == 2;

	for (num = 3; num <= n/num; num += 2)
		if (!(n % num)) 
			return 0;
	return 1;
}

int main()
{
	unsigned int l,u,i,sum=0;

	printf();
	scanf(,&l,&u);

	for(i=l;i<=u;i++){
		if(isPrime(i)==1)
			{
				printf(,i);
				sum++;
			}
	}

	printf(,l,u,sum);

	return 0;
}