Looking for help solving problem 2.e 45^1441251 mod 546

I am using Eulers theorem 2nd version because the gcd of (45,546) is not 1,

so a^k* totient(n)+1

i get

45^k *144 +1 mod 546 but cant find k is there are video anyone knows about to find k

thank you,

Daniel G.