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

Ex Input:
['z', 'j', 'G', 'w', 'h', 5009, 'z', 'r', '1279', 'z', '1337', 'R', 'R', 9761, 'D', 713], ['a', 'T', 'A', 'z', 'r', '1279', 'z', '1337', 'R', 'J', 'z', 'L', 'P']

Ex Output:
z, r, 1279, z, 1337, R


Ex Input:
['L', 5499, 'z', 'J', 'I', 't', 6291], [337, 5087, 'z', 'J', 'I', 'p', 'm']

Ex Output:
z, J, I


Ex Input:
[725, 1327, 8571, 'v', 'r', '1443', 't', 839], ['l', 4593, 'v', 'r', '1443', 'r', 9415, 5449]

Ex Output:

v, r, 1443