PrimePairs

package ProgrammingBasics.NestedLoops;

import java.util.Scanner;

public class PrimePairs12 {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int firstPairStart = Integer.parseInt(scanner.nextLine());
        int secondPairStart = Integer.parseInt(scanner.nextLine());
        int firstControlNumber = Integer.parseInt(scanner.nextLine());
        int secondControlNumber = Integer.parseInt(scanner.nextLine());
        int endFirstPair = firstPairStart + firstControlNumber;
        int endSecondPair = secondPairStart + secondControlNumber;

        for (int i = firstPairStart; i <= endFirstPair ; i++) {
            boolean isSimple = true;
            for (int l = 2; l <= i / 2; l++) {
                if (i % l == 0) {
                    isSimple = false;
                }
            }
                for (int j = secondPairStart; j <= endSecondPair; j++) {
                    boolean isSimpleSecond = true;
                    for (int k = 2; k <= j / 2; k++) {
                        if (j % k == 0) {
                            isSimpleSecond = false;
                        }
                    }
                    if (isSimple && isSimpleSecond) {
                        System.out.printf("%d%d%n", i, j );
                    }
                }
        }
    }
}