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

Input: Consider Input: kUoqCMPFTqGE, guoqCMPkwJs

Output: oqCMP


Input: Consider Input: hGyDyQYdxCCuD, BQiFOyQYdxel

Output: yQYdx


Input: Consider Input: ThNiJIifoxYKkdXwVjpvLMDrmBvw, McxYKkdXwVjpBVdF


Output: xYKkdXwVjp