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

Ex Input:
UldKHMpUYADGfEUGcSon, nPHMpUYADGfEKqHCLPmL

Ex Output:
HMpUYADGfE


Ex Input:
osmJJcZlDAXBgJFsJKa, rzPNlDAXBgJYrgXlH

Ex Output:
lDAXBgJ


Ex Input:
TSrkLrBvO, ulikLrhJ

Ex Output:

kLr