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

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


[Q]: PGjDRPDzGaBR, rpIJRPDzWi
[A]: RPDz


[Q]: fJYNasneyMjyQjGfuNyJrWnfku, XrgwSwgyMjyQjGfuNkLFBfjtWYL
[A]:
yMjyQjGfuN