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

Q: BmxgSFWBlVX, kGgKrgSFWBlGunFcZ

A: gSFWBl
****
Q: aeQjEeiWGONmzGimhGiw, RIEeiWGONmOZuVYr

A: EeiWGONm
****
Q: EGNOYoPE, rTUdNOYoiMh

A:
NOYo
****