Java Program to find the count of distinct prime subsequences at most of of length K from a given array
import java . util . * ; class GFG { static boolean [ ] prime = new boolean [ 100001 ] ; static void SieveOfEratosthenes ( ) {