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.

[987, 885, 2111, 'P', 'e', 'h', 'h', 'C', 'P', 'V', '4563', 'E', 'J', 'M', 'n', 'C', 'Q', 'P', 'k', 'S', 'M', '8993', '8675', '6707', 'Q', 'r', '4351', 'Q', 'q', 'a', 6295, 1061, 1619, 3509, 8583, 'f', 1157, 5365, 'l', 'x', 'B', 'U', 141, 5753, 'F', 7595, 'H'], [8245, 137, 5887, 1267, 5851, 'n', 7393, 'f', 9739, 9983, 'h', 'h', 'C', 'P', 'V', '4563', 'E', 'J', 'M', 'n', 'C', 'Q', 'P', 'k', 'S', 'M', '8993', '8675', '6707', 'Q', 'r', '4351', 'Q', 'q', 'F', 'k', 3463, 'U', 3587, 't', 'j', 'q', 'M', 1213, 9955, 'h', 9779, 'l', 8839, 'G', 8477, 9341, 6071, 'm']
Output:
h, h, C, P, V, 4563, E, J, M, n, C, Q, P, k, S, M, 8993, 8675, 6707, Q, r, 4351, Q, q