In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.

Q: AkYuNemHGBEDF, uluNemHGAycbWX

A: uNemHG
****
Q: euQWhCovKplukMYznXcD, XAfMhKdzhCovKplukMcMlSuBw

A: hCovKplukM
****
Q: XRrLuCvmmRSNmboenTezoImn, HVdkgARvRSNmboenTUPsKxcT

A:
RSNmboenT
****