Can any one solve this

C++ code N^(f(X)) mod M

f(X) is defined as product of primes upto X

1<=N,M<=10^9

1<=X<=10^6

Can someone explain how hacking in codefores work? how does hacking effect ratings? how many hacks one can do.?