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.

[485, 'q', 'b', 'B', 7577, 1583, 'r', '5845', 'T', '4221', '4923', '205', 'A', '3587', '3337', 'H', 'o', '8245', 'Y', 'F', '3463', '8447', 'z', '9921', '5487', 'J', 5665, 'S', 3109, 'K', 'y'], [4949, 9589, 'L', 'F', 8709, 'a', 'w', 'G', '5845', 'T', '4221', '4923', '205', 'A', '3587', '3337', 'H', 'o', '8245', 'Y', 'F', '3463', '8447', 'z', '9921', '5487', 'D', 'm', 'N', 'v', 7123, 'u', 7727]
Output:
5845, T, 4221, 4923, 205, A, 3587, 3337, H, o, 8245, Y, F, 3463, 8447, z, 9921, 5487