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

Q: plSfJAktMfac, TCjYJAktlt

A: JAkt
****
Q: EOacPYivmmUlYenynBqAwx, MoZWMOeXmUlYenynBEendWg

A: mUlYenynB
****
Q: ZEuHLgDUzmwPeSWQZ, iLmSZtOLgDUzmwPmYpaO

A:
LgDUzmwP
****