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

Ex Input:
WTnsmP, INnsIM

Ex Output:
ns


Ex Input:
vhZuXCsIkQR, YflCuXCsIkLu

Ex Output:
uXCsIk


Ex Input:
PQlAWudejgMiDdMXnwbFru, BPejgMiDdMvofwk

Ex Output:

ejgMiDdM