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

Example Input: andNlOdIcQMyZvc, vCMENolkslOdIcQMyZJtCFo
Example Output: lOdIcQMyZ

Example Input: yjoJzBGdwfOhsceoOpoap, uSLMdBGdwfOhsIQHBijd
Example Output: BGdwfOhs

Example Input: kNKgSvsaptSroTIPDXEAPJJ, ZUNvKJJrcIvsaptSroTIisNhNXgZ
Example Output:
vsaptSroTI