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

Ex Input:
ezVsFayUPcrte, lfsFayUMPTqx

Ex Output:
sFayU


Ex Input:
OXdSmcKG, XbDdSmJl

Ex Output:
dSm


Ex Input:
ZEczsOMqjQshzyuo, dZUUXXqjQshzyqznKq

Ex Output:

qjQshzy