import java.util.Scanner; publicclassMain{ publicstatic Scanner sc = new Scanner(System.in); publicstaticvoidmain(String[] args){ int N = sc.nextInt(); int K = sc.nextInt(); int[] num = newint[N]; int Sk = 0; for (int i = 0; i < N; i++) { num[i] = sc.nextInt(); } sc.close(); for (int i = 0; i < N - K; i++) { int sumPrimes = 0; for (int j = 0; j < K; j++) { if (isPrimes(num[i + j])) { sumPrimes += num[i + j]; } } if (sumPrimes > Sk) { Sk = sumPrimes; } } System.out.println(Sk); } publicstaticbooleanisPrimes(int num){ for (int i = 2; i < num; i++) { if (num % i == 0) { returnfalse; } } returntrue; } }