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.

['Y', 1569, 4339, 6855, 5463, 2097, '9179', 'i', '2309', '4213', 'U', 'V', 'Y', 'S', 'm', '8887', '7131', 'O', '3495', 'b', '425', '2967', '409', '9077', '2279', '9335', 't', 'x', 'd', '4905', 'J', 'D', 3945, 'd', 'N', 'D', 'q', 'p', 225, 'U', 'z', 'd', 4391, 'O', 7985, 'y', 'B', 'D', 3261, 5819, 'M'], ['U', 'C', 'O', 6819, 3129, 6291, 5733, 9907, 2899, 3161, 's', 'J', 'C', 'x', 3195, 'n', 'j', 8677, 'o', '9179', 'i', '2309', '4213', 'U', 'V', 'Y', 'S', 'm', '8887', '7131', 'O', '3495', 'b', '425', '2967', '409', '9077', '2279', '9335', 't', 'x', 'd', '4905', 'J', 'L', 9743, 'T', 1863]
Output:
9179, i, 2309, 4213, U, V, Y, S, m, 8887, 7131, O, 3495, b, 425, 2967, 409, 9077, 2279, 9335, t, x, d, 4905, J