taking mod from every iteration in factorial computing in c++ to not get a number overflow

Question

So, I\'m now learning competitive programming, and the topic was "modular arithmetic". It\'s said that you can use (a*b) % c = ((a % c) * (b % c)) % c and the book tel