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

Ex Input:
BmxgSFWBlVX, kGgKrgSFWBlGunFcZ

Ex Output:
gSFWBl


Ex Input:
edjRAatlaiCmWkpqMh, qDZYVWCDTRAatlaiCmYH

Ex Output:
RAatlaiCm


Ex Input:
yYFycVORNcFfkOpuws, btEVORNcFfkOfyCavNu

Ex Output:

VORNcFfkO