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

Input: Consider Input: nTAXUw, OWAXYU

Output: AX


Input: Consider Input: OhMVLbQhBxEaOZY, iDVLbQhBxBiiD

Output: VLbQhBx


Input: Consider Input: XIydoVlvEdIKhMtEg, RItMikVlvEdIKhMkt


Output: VlvEdIKhM