You will be given a definition of a task first, then some input of the task.
In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.

['n', 'W', 'i', 'K', 2711, 3819, 3121, 537, 'b', 'R', 'a', 'L', 9525, 4387, 'd', 'q', 'V', '8621', 'S', '1969', 'Z', 'd', 'q', '2441', 'h', 'f', '6131', '4119', 'P', 'N', '9983', 'o', 'g', 'V', 7589, 5107, 'j', 'Z', 1463, 6377, 6067, 6867, 6039, 'H', 's', 'E'], [9135, 6091, 'K', 4859, 'q', 'G', 'V', 'p', 8559, 'F', 'X', 9801, 4643, 5531, 7251, 'q', 'V', '8621', 'S', '1969', 'Z', 'd', 'q', '2441', 'h', 'f', '6131', '4119', 'P', 'N', '9983', 'H', 2205, 2319, 2013, 1597, 3171, 'A', 'h', 'c']
Output:
q, V, 8621, S, 1969, Z, d, q, 2441, h, f, 6131, 4119, P, N, 9983