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

Ex Input:
xMxyohPBlJIEBqghiMdBQPwq, xsBlJIEBqghlMosK

Ex Output:
BlJIEBqgh


Ex Input:
CkZOSZevST, bbZOSZIg

Ex Output:
ZOSZ


Ex Input:
aLmgeKaHJG, DdgeKaUVqU

Ex Output:

geKa