Java implementation to find the row whose product has maximum number of prime factors
import java . util . * ; class GFG { static final int N = 3 ; static final int M = 5 ; static int Large = ( int ) 1e6 ; static Vector < Integer > prime = new Vector < Integer > ( ) ;