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

[EX Q]: YHLJZrFQ, aSLJZQuo
[EX A]: LJZ

[EX Q]: SUgXyznbUQRpiLUTlRb, jlnwLTnbUQRpioUFyJ
[EX A]: nbUQRpi

[EX Q]: rMUngKgFfiQlmqJkDSiXSDDsJ, wYfiQlmqJkDLyVCyjRQ
[EX A]:
fiQlmqJkD