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

Example Input: ['t', 845, 'T', '5285', '7837', 'N', 6717], [7211, 7903, 'U', 'T', '5285', '7837', 'D', 'U', 'R']
Example Output: T, 5285, 7837

Example Input: [8769, 8805, 'W', 'a', 'l', '9061', 'b', 'A', 'D'], [3199, 'o', 'm', 'a', 'l', '9061', 'b', 'v', 'g']
Example Output: a, l, 9061, b

Example Input: [9955, 3509, 3061, 'b', 8167, 'L', 7121, 'W', 'p', 'C', 'I', '5873', '7421', 'O', '6175', 'z', '2829', 'G', 2219, 1491, 7169, 'F', 'm', 2351, 1483, 605], [5275, 'i', 'g', 1181, 'u', 'Z', 'u', 3753, 'p', 'W', 'p', 'C', 'I', '5873', '7421', 'O', '6175', 'z', '2829', 'y', 'D', 1097]
Example Output:
W, p, C, I, 5873, 7421, O, 6175, z, 2829