Function to generate all prime numbers up to 2 * 10 ^ 5 using Sieve of Eratosthenes
static void Sieve ( ) { index = 0 ; int p [ ] = new int [ N + 1 ] ; for ( int i = 0 ; i <= N ; i ++ ) { p [ i ] = 1 ; }