I know how to use truth tables to prove they are equivalent, but how do I prove symbolically using the rules of logic?

Show that (p -> ((not q) and r)) and (not p or (not (r implies q))) are logically equivalent:

(I wrote out some of the symbols for keys that I do not have)

I have no idea what to do now. Any help would be appreciated! Thank you!