A prime triplet is a collection of three prime numbers in the form (p, p + 2, p + 6) or (p, p + 4, p + 6).

Write a program in Java to display all the possible prime triplets in the range m and n, where the value of m and n are entered by the user.

Example:
INPUT:
M = 1
N = 20
OUTPUT:
5, 7, 11
7, 11, 13
11, 13, 17
13, 17, 19

import java.io.*;
class PrimeTriplet{
    public static void main(String args[])throws IOException{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        System.out.print("M = ");
        int m = Integer.parseInt(br.readLine());
        System.out.print("N = ");
        int n = Integer.parseInt(br.readLine());
        for(int i = m; i <= n; i++){
            int p1 = i;
            int p2 = i + 2;
            int p3 = i + 6;
            if(p2 > n || p3 > n)
                break;
            if(isPrime(p1) && isPrime(p2) && isPrime(p3))
                System.out.println(p1 + ", " + p2 + ", " + p3);
            p1 = i;
            p2 = i + 4;
            p3 = i + 6;
            if(p2 > n || p3 > n)
                break;
            if(isPrime(p1) && isPrime(p2) && isPrime(p3))
                System.out.println(p1 + ", " + p2 + ", " + p3);
        }
    }
    public static boolean isPrime(int n){
        int f = 0;
        for(int i = 1; i <= n; i++)
            if(n % i == 0)
                f++;
        return f == 2;
    }
}