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

Ex Input:
sEYtoQlG, XIstoQQPw

Ex Output:
toQ


Ex Input:
jJSSBmflUyrEMLjSycA, YkmujkSSBmflUyrKKJZ

Ex Output:
SSBmflUyr


Ex Input:
lzGGDnLpr, ddGPGDnLPrp

Ex Output:

GDnL