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:
oCtWZYdkvZ, pkktWZYdEHMW

Ex Output:
tWZYd


Ex Input:
EvflOktFVEXAgooOKrMFM, gnWmhlKFVEXAgoCxyKP

Ex Output:

FVEXAgo