#include<iostream>
#include<vector>
#include<set>
#include<algorithm>
using namespace std;
bool sost[80007];
vector<int>primes,superprimes;
bool used[80007];
int main()
{
	int a, b;
	cin >> a >> b;
	for (int i = 2; i <= b; i++)
	{
		if (!sost[i])
		{
			primes.push_back(i);
			for (int j = 2 * i; j <= b; j += i)
			{
				sost[j] = true;
			}
		}
	}
	for (int i = 0; i < primes.size(); i++)
	{
		for (int j = 0; j < primes.size(); j++)
		{
			if (primes[i] + primes[j]>b) break;
			if (primes[i] + primes[j]<a) continue;
			superprimes.push_back(primes[i] + primes[j]);
		}
	}
	sort(superprimes.begin(), superprimes.end());
	for (int i = 0; i < superprimes.size(); i++)
	{
		int cur = superprimes[i];
		if (used[cur]) continue;
		used[cur] = true;
		cout << cur << ' ';
	}
	cout << endl;
}