Square and multiply
Each line doubles the exponent by squaring, adds one more by multiplying by the base when the bit is 1, and then keeps only the remainder mod 1000003 so the numbers stay small. The table stops after 20 lines; the same two moves carry on for the rest of the bits.
Using a2k=(ak)2,a2k+1=(ak)2×a
71≡7(mod1000003)73≡72×7=343(mod1000003)77≡3432×7=823543(mod1000003)714≡8235432=678223072849≡38186(mod1000003)729≡381862×7=10207194172≡163551(mod1000003)758≡1635512=26748929601≡849357(mod1000003)7117≡8493572×7=5049851194143≡44635(mod1000003)7235≡446352×7=13945982575≡940740(mod1000003)7470≡9407402=884991747600≡92633(mod1000003)7941≡926332×7=60066108823≡928628(mod1000003)71883≡9286282×7=6036449736688≡627395(mod1000003)73767≡6273952×7=2755371402175≡136086(mod1000003)77535≡1360862×7=129635795772≡406867(mod1000003)715070≡4068672=165540755689≡259069(mod1000003)730140≡2590692=67116746761≡545413(mod1000003)760281≡5454132×7=2082327383983≡137020(mod1000003)7120563≡1370202×7=131421362800≡968540(mod1000003)7241126≡9685402=938069731600≡917402(mod1000003)7482253≡9174022×7=5891385007228≡333127(mod1000003)7964506≡3331272=110973598129≡265210(mod1000003)⋮