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.

['w', 'A', 3063, 'a', 'L', '6971', 'p', '1807', '7273', '4207', '6359', '2585', '2263', 'y', '2017', '2825', '2657', 'F', '1867', 'X', 'x', 'x', 'b', 'Y', 'M', 'e', '781', 'Y', '2597', '2051', 'M', 3739, 'c', 'E', 5121, 2609, 981, 5847, 2819, 2541, 3705, 6237, 'k', 'V'], [1321, 6337, 9543, 10029, 'F', 'U', 9785, 83, 3387, 1497, 'u', 2111, 'g', 'J', 3867, 'W', 2273, 'a', 'L', '6971', 'p', '1807', '7273', '4207', '6359', '2585', '2263', 'y', '2017', '2825', '2657', 'F', '1867', 'X', 'x', 'x', 'b', 'Y', 'M', 'e', '781', 'Y', '2597', '2051', 'b', 7393, 625, 'J', 'C', 2399, 5553, 'I', 9651, 4775, 'c', 2807, 5125, 'A', 'j', 7743, 7547, 'W', 9911]
Output:
a, L, 6971, p, 1807, 7273, 4207, 6359, 2585, 2263, y, 2017, 2825, 2657, F, 1867, X, x, x, b, Y, M, e, 781, Y, 2597, 2051