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

Input: Consider Input: jexvmCmveGzFUimQMx, RVwOSJveGzFUimrcOwjEwe

Output: veGzFUim


Input: Consider Input: DGvUCrUVlUnQBShkWnfnceGasvI, NfzGUnQBShkWnpLMnY

Output: UnQBShkWn


Input: Consider Input: LnLEMmig, jpLEMmbnkT


Output: LEMm