**The modular exponential function.**
The graph of the discrete modular exponential function

*f*(*m*) = *m*^{e} mod *n*,

which is used for the RSA algorithm,
is plotted for 0

*m* <

*n*
Please insert integer values for

*e* and

*n*
(terminate your input with the return key):