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

Ex Input:
yywhNdZQkLSzbOvhluicHA, lfZQkLSzbOvhVC

Ex Output:
ZQkLSzbOvh


Ex Input:
XYnCjAWPHHJ, gmCjAWPHpmwVsm

Ex Output:
CjAWPH


Ex Input:
OInswERuALEIOpVybIgFjPF, mFvzKuItEIOpVybIgFzY

Ex Output:

EIOpVybIgF