Prime factorization with Grover's and Shor's algorithm using quantum annealing computer -- 2

I need some help as explained below in the following matters: Along this project, I need you to teach me and help me in : - Knowing how to combine these two algorithms (Grover's and Shor's algorithms) to decrypt simple RSA encryptions. - Convert equations into simulated annealing (SA) problems. - Provide technical documentation and insight for this prime factorization. For this endeavor, I have been able to grant myself access to quantum annealing computational power equaling 461 logical qubits with 4539 qubits dedicated to error correction, as of 12 qubits correcting errors for each 1 logical qubit. By the time I choose the best fit for the job, you are welcome to send propositions that will prove helpful in both pushing this project forward and in choosing the right candidate for the job.