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

Ex Input:
XmiLktrUjJDOCJ, UIKrUjJDOQsR

Ex Output:
rUjJDO


Ex Input:
BeEgLISxThm, UGLISxEtP

Ex Output:
LISx


Ex Input:
TINLQSMNQmewEmPRHvRzuBxtd, RaBpHkiMNQmewEmPRrNwV

Ex Output:

MNQmewEmPR