#include <iostream>
#include <cmath>

using namespace std;

int main(int argc, char* argv[])
{
	long long a, b;
	cin >> a >> b;
	for(long long n = max(2LL, a); n <= b; n++)
	{
		int sqrt_n = (int)(0.1+sqrt((double)n));
		bool prime = true;
		for(int p=2; p<=sqrt_n; p++)
		{
			if(n%p==0)
			{
				prime = false;
				break;
			}
		}
		if(prime)
			cout << n << endl;
	}
	return 0;
}