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.

[8039, 4457, 'z', 3519, 'q', 'T', 'k', 'b', 'H', 'W', 'H', '5561', '1389', '6389', '6923', '339', 'Q', '5837', 'D', 'z', 'F', '4743', '7197', '1407', '9711', '4355', '4027', '2219', 'w', 'S', 'Z', 'f', '4091', '2571', 'd', 1527, 'o', 1393, 't', 7653], ['g', 2437, 'm', 'b', 2347, 'Q', 6719, 2049, 6643, 'B', 6919, 1873, 'K', 9319, 6729, 'Z', 'E', 8011, 7953, 'M', 1121, 'k', '5561', '1389', '6389', '6923', '339', 'Q', '5837', 'D', 'z', 'F', '4743', '7197', '1407', '9711', '4355', '4027', '2219', 'w', 'S', 'Z', 'f', '4091', '2571', 'o', 1481, 867, 'B', 29]
Output:
5561, 1389, 6389, 6923, 339, Q, 5837, D, z, F, 4743, 7197, 1407, 9711, 4355, 4027, 2219, w, S, Z, f, 4091, 2571