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

Example Input: ['t', 3815, '7171', 'I', 'm', '3035', 'a', 'V', 2889, 'm'], [5911, 4525, 'R', 133, '7171', 'I', 'm', '3035', 'P', 'W', 'f', 4045]
Example Output: 7171, I, m, 3035

Example Input: ['O', 'k', 'E', 281, 'J', 'J', 'z', 9541, 'K', 'Y', 'G', 's', 'J', 'h', 'o', '2303', '603', 'M', '5785', '7949', 'P', '9685', 'd', '801', '5021', '479', 'd', 'A', '1609', 'T', 'b', 'd'], [3187, 1933, 'u', 'E', 'Y', 2413, 'W', 'f', 'V', 9713, 4903, 'f', 'G', 's', 'J', 'h', 'o', '2303', '603', 'M', '5785', '7949', 'P', '9685', 'd', '801', '5021', '479', 'd', 'A', '1609', 'T', 'i', 5937, 'j', 1943, 'N', 9789, 'p', 3693, 2243, 9701, 6051, 6437, 'K', 4251, 5597, 'A', 'O', 'Y', 'P', 2435]
Example Output: G, s, J, h, o, 2303, 603, M, 5785, 7949, P, 9685, d, 801, 5021, 479, d, A, 1609, T

Example Input: ['v', 'g', 5147, 'V', 'o', '4175', 'i', 'f', 'd', 'I', 9485, 'W', 'w'], [1747, 8825, 219, 5929, 'V', 'o', '4175', 'i', 'f', 'v', 'T']
Example Output:
V, o, 4175, i, f