Modular exponentiation WITHOUT modular exponentiation Given that $719$ is prime, find the least positive residue of $11^{721} \pmod {719}$, without using modular exponentiation.

So, I know how to use modular exponentiation and have done it to get the answer $612$, but I have no idea how to do this without modular exponentiation...

Any ideas for a method I can try?
HINT:

As $719$ is prime, $(11,719)=1$ and $11^{719-1}\equiv1\pmod {719}$ using Fermat's Little Theorem

So, $11^{721}=11^3\cdot11^{718}\equiv 11^3\pmod{719}\equiv\cdots$
This is a simple application of Fermat's Little theorem.

** 
if M is prime, then to find ab % M,

r = b % (M-1)

c = a % M

ab % M = cr % M

**

721 % 718 = 3

11 % 719 = 11

Therefore, 11721 % 719 = 113 % 719 = 612

So, there is no need to perform modular exponentiation if Mod value is given prime.