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

Ex Input:
ykDpbd, YFDpmO

Ex Output:
Dp


Ex Input:
libDFDxIgRiglWfxMVRr, yMltDxIgRiglpms

Ex Output:
DxIgRigl


Ex Input:
ABpnvjvWQGIRhJPPvRCsOui, tuDmNaHvWQGIRhJPPcnvGnufklq

Ex Output:

vWQGIRhJPP