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

Input: Consider Input: OXdSmcKG, XbDdSmJl

Output: dSm


Input: Consider Input: DFRoMPNDAzNgtLsEPseOzC, qykyPjDAzNgtLsEPYTsNrJaNK

Output: DAzNgtLsEP


Input: Consider Input: bHUVWgEa, sHAUVWCIi


Output: UVW