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

Example Input: ['Y', 'Z', 'm', 'S', '3631', 'v', 'x', 5851, 615, 'm'], ['D', 'D', 'm', 'S', '3631', 'v', 'O', 'D']
Example Output: m, S, 3631, v

Example Input: [6397, 'W', 'k', 'v', 'E', '1941', '2295', 'q', '1357', '2041', '5263', '7781', 'w', 'N', 1329, 5233, 'U', 2563, 'L', 8547], [1857, 'F', 'g', 8381, 165, 'o', 7009, 5455, '1941', '2295', 'q', '1357', '2041', '5263', '7781', 'w', 'X', 'g']
Example Output: 1941, 2295, q, 1357, 2041, 5263, 7781, w

Example Input: ['k', 3741, 847, 5239, 'h', 979, 2229, 'x', '127', '581', 'B', 'b', 'k', '9709', 'I', 'f', 'P', 9605, 'j', 'c'], [3295, 'a', 'v', 4189, 5991, 1967, 'U', 'x', '127', '581', 'B', 'b', 'k', '9709', 'I', 'm', 'u', 2891, 4043, 4873, 1095, 'a']
Example Output:
x, 127, 581, B, b, k, 9709, I