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

Input: Consider Input: BeEgLISxThm, UGLISxEtP

Output: LISx


Input: Consider Input: IobjElBjKvpepE, kRulBjKvvxU

Output: lBjKv


Input: Consider Input: wbKifPxMnScCZkIzWrZAZmvMjj, RKwstXFCxMnScCZkIzIVXvCp


Output: xMnScCZkIz