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

[EX Q]: lrBJDRkT, jmBJDrI
[EX A]: BJD

[EX Q]: vMsEJRoLkWcmkuwNRz, ZmoLkWcmVZiBv
[EX A]: oLkWcm

[EX Q]: EOacPYivmmUlYenynBqAwx, MoZWMOeXmUlYenynBEendWg
[EX A]:
mUlYenynB