public int multiply(int x , int y ) {
		if( x==0 || y == 0)
			return 0;
		return exp[ log[x] + log[y]];
	}
public int multiply ( int x , int y ) { if ( x == 0 || y == 0 ) return 0 ; return exp [ log [ x ] + log [ y ] ] ; }
Computes the following (x*y) mod primitive. This is done by