//import java.math.BigInteger;
import java.util.Scanner;

public class prime {

	public static void main(String args[]) {

		System.out.println("Enter the number to start at: ");
		int end = new Scanner(System.in).nextInt();
		System.out.println("Enter the number to end at: ");
		int limit = new Scanner(System.in).nextInt();

		int total = 0;
		System.out.println("Printing prime number from 1 to " + limit);
		for (int number = (end + 1); number <= limit; number++) {

			if (isPrime(number)) {
				System.out.println(number);
				total++;
			}
		}

		System.out.println("Done");
		System.out.println("There are " + total + " prime numbers between " + end + " and " + limit);
	}

	public static boolean isPrime(int number) {

		for (int i = 2; i < number; i++) {
			if (number % i == 0) {
				return false;
			}
		}
		return true;
	}

}