#include <stdio.h>
#include <math.h>
int prime(int p);
void Goldbach(int n);
int main()
{
int m, n, i, cnt;
scanf("%d %d", &m, &n);
if (prime(m) != 0) printf("%d is a prime number\n", m);
if (m < 6) m = 6;
if (m % 2) m++;
cnt = 0;
for (i = m; i <= n; i += 2) {
Goldbach(i);
cnt++;
if (cnt % 5) printf(", ");
else printf("\n");
}
return 0;
}
int prime(int p) {
int back=0;
if (p == 2) back = 1;
for (int i = 1; i < p+1; i++)
{
if (!(p%i)) {
if ((i>1)&&(i<p)) {
return back;