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

Input: Consider Input: bmsrkXGb, GcarkXOZF

Output: rkX


Input: Consider Input: BVipiZoGXaWdjmDsxWP, yxppsiYkiZoGXaWdjoDRuKW

Output: iZoGXaWdj


Input: Consider Input: BAEBdGWM, exEBdGGB


Output: EBdG