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.

[8331, 4395, 495, 5347, 3617, 5443, 9535, 1657, 'b', 'A', 1907, 'C', 7571, 'I', 9639, 'Y', 'C', 'w', 'c', '9211', '3105', '9823', 'h', '3303', 'J', 'x', '5027', '2005', '1031', 'J', '5063', '5811', 'm', '5001', '6463', '7923', 'C', '8553', 'S', 6935, 'D', 5421, 'i', 247, 6859, 'U', 9711, 4605, 9411, 'f', 'f', 3739, 6887, 'B', 8217, 'Q', 177, 'l'], [2419, 'E', 'd', 'w', 'c', '9211', '3105', '9823', 'h', '3303', 'J', 'x', '5027', '2005', '1031', 'J', '5063', '5811', 'm', '5001', '6463', '7923', 'C', '8553', 'r', 'V', 99, 'T', 'Z', 3525, 5227, 2405, 4789, 8107]
Output:
w, c, 9211, 3105, 9823, h, 3303, J, x, 5027, 2005, 1031, J, 5063, 5811, m, 5001, 6463, 7923, C, 8553