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.

[4665, 'U', 1617, 4891, 3015, 'k', '9381', '4077', 'f', 'T', 'G', 'z', '9879', 'q', 'f', 'g', 'G', '8765', 'D', '1755', 'B', 'H', 'y', 6819, 9689, 4667, 6651, 'Z', 4359, 3239, 'k'], [4575, 7833, 7267, 't', 'C', 'k', '9381', '4077', 'f', 'T', 'G', 'z', '9879', 'q', 'f', 'g', 'G', '8765', 'D', '1755', 'v', 4883, 'l', 3055]
Output:
k, 9381, 4077, f, T, G, z, 9879, q, f, g, G, 8765, D, 1755