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

Example Input: VeLJEBYpZwxVQlo, EZEBYpZwxVQIxjFj
Example Output: EBYpZwxVQ

Example Input: wcJmSloqlddFOfv, szhUIAqzSloqlddFDJz
Example Output: SloqlddF

Example Input: pIkAtJHVcvzzZVz, btWerNSHVcvzzZTz
Example Output:
HVcvzzZ

