import java.util.*;

class FindPrime{
        static boolean isPrime(long number) {
                boolean isPrime = false;
                int i = (int) Math.ceil(Math.sqrt(number));
                while (i > 1) {
                        if ((number != i) && (number % i == 0)) {
                                isPrime = false;
                                break;
                        } else if (!isPrime)
                                isPrime = true;
                        --i;
                }
                return isPrime;
        }

        public static void main(String[] args) {
                Scanner input = new Scanner(System.in);
                System.out.print("Enter N: ");
                long num1 = input.nextLong();
                System.out.print("Enter M: ");
                long num2 = input.nextLong();

                   for (long i = num1; i <=num2; i++) {
                      if (isPrime(i)) {
                      System.out.println(i);
                      }
                    }
                   }
                }