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

Ex Input:
goyZUz, QryZlD

Ex Output:
yZ


Ex Input:
fAsWQxuyBevvLogrSrgg, tmdBEUxuyBevvLogXjiMCbh

Ex Output:
xuyBevvLog


Ex Input:
AuZgCkTmEuavVQPsMTnHO, IzJygEuavVQPsMOGqs

Ex Output:

EuavVQPsM