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

Ex Input:
yxJxNRLEnKGHziJtfb, KfReWhEnKGHzitzfPWzK

Ex Output:
EnKGHzi


Ex Input:
VXSNlHzkB, EoNlHCiL

Ex Output:
NlH


Ex Input:
sOThHVYgmCmDbobbfkGc, YrMiebTYgmCmDbxsSR

Ex Output:

YgmCmDb