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

Input: Consider Input: HhBhJMpxpty, MxTJMpxnQEf

Output: JMpx


Input: Consider Input: apGMPThLTCw, LvMPThYW

Output: MPTh


Input: Consider Input: sruxfpU, KFuxfNp


Output: uxf