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

Example Input: ['h', 'l', 2659, 5135, 4075, 'B', 'Z', 7075, '8385', 'I', '5937', 'N', 'H', '7143', '9643', '7171', 'z', 'c', 'A', '2163', 'm', 5383, 'S', 8583, 3589, 'S'], [5819, 317, 1243, 6949, 3195, 'A', 'p', 'F', 'Z', 4825, 'U', '8385', 'I', '5937', 'N', 'H', '7143', '9643', '7171', 'z', 'c', 'A', '2163', 'Y', 'r', 7985, 'T', 'F', 3637, 'D', 2203, 6855, 'W', 'Z', 4121]
Example Output: 8385, I, 5937, N, H, 7143, 9643, 7171, z, c, A, 2163

Example Input: [1065, 2741, 'w', 'B', 'X', '5865', 's', '2579', '3679', 'K', 4415, 5237], [9019, 4795, 8363, 1935, 9883, 'X', '5865', 's', '2579', '3679', 'y', 4605, 8603, 1243, 9199]
Example Output: X, 5865, s, 2579, 3679

Example Input: ['M', 'f', 'I', '4135', 'k', 9079], ['r', 3109, 'I', '4135', 'j', 877]
Example Output:
I, 4135