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

Example Input: [787, 577, 1283, 10019, '3229', 'C', 'b', '8319', 'j', 7553, 8091], [4091, 1749, 'L', 'A', '3229', 'C', 'b', '8319', 'U', 9603]
Example Output: 3229, C, b, 8319

Example Input: ['U', 6489, 'o', 'e', 'Z', 'G', '8175', 'r', '1915', '8587', '8845', 'I', 'B', 'R', 'N', 9533, 'd'], ['U', 4287, 'f', 'R', 1407, 3893, 6739, 'o', 'e', 'Z', 'G', '8175', 'r', '1915', '8587', '8845', 'Z', 2981, 'i', 'a', 'k', 5909, 'S', 9997]
Example Output: o, e, Z, G, 8175, r, 1915, 8587, 8845

Example Input: ['O', 9613, 'i', '4915', 'b', '9121', 'd', 'v', 'e', 1751, 'R'], [1891, 'u', '4915', 'b', '9121', 'd', 'K', 'C', 9519]
Example Output:
4915, b, 9121, d