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

Ex Input:
xzMUdHcoYJFWLOILjrg, vCscoYJFWLzO

Ex Output:
coYJFWL


Ex Input:
qMnjlfIsQRtUlPggCpHqu, gfVndMwYDIsQRtUlPgqBJKCX

Ex Output:
IsQRtUlPg


Ex Input:
jLlCGUaNDeSPae, vJrGUaNDbcMV

Ex Output:

GUaND