ProgBasics07Nested-Loops-MoreExercisesY06PrimePairs

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int num1 = Integer.parseInt(scanner.nextLine());
        int num2 = Integer.parseInt(scanner.nextLine());

        int num1To = Integer.parseInt(scanner.nextLine());
        int num2To = Integer.parseInt(scanner.nextLine());

        for (int n = num1; n <= num1 + num1To; n++) {
            for (int m = num2; m <= num2 + num2To; m++) {
                boolean isNPrime = true;
                boolean isMPrime = true;

                for (int i = 2; i <= Math.sqrt(n); i++) {
                    if (n % i == 0) {
                        isNPrime = false;
                        break;
                    }
                }
                for (int j = 2; j <= Math.sqrt(m); j++) {
                    if (m % j == 0) {
                        isMPrime = false;
                        break;
                    }
                }

                if (isNPrime && isMPrime) {
                    System.out.printf("%d%d%n", n, m);
                }
            }
        }
    }

}